./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_SAX_nondet_test4-1.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_SAX_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:36:34,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:36:35,025 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:36:35,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:36:35,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:36:35,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:36:35,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:36:35,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:36:35,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:36:35,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:36:35,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:36:35,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:36:35,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:36:35,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:36:35,068 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:36:35,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:36:35,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:36:35,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:36:35,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:36:35,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:36:35,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:36:35,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:36:35,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:36:35,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:36:35,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:36:35,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:36:35,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:36:35,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:36:35,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:36:35,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:36:35,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:36:35,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:36:35,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:36:35,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:36:35,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:36:35,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:36:35,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:36:35,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:36:35,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:36:35,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:36:35,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:36:35,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:36:35,080 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-11 16:36:35,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:36:35,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:36:35,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:36:35,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:36:35,354 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:36:35,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-10-11 16:36:36,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:36:37,088 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:36:37,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-10-11 16:36:37,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65dff520b/e5a21b8351324f82b8943b2a2c842b2d/FLAG0223e231a [2024-10-11 16:36:37,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65dff520b/e5a21b8351324f82b8943b2a2c842b2d [2024-10-11 16:36:37,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:36:37,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:36:37,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:36:37,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:36:37,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:36:37,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:36:37" (1/1) ... [2024-10-11 16:36:37,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b4f0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:37, skipping insertion in model container [2024-10-11 16:36:37,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:36:37" (1/1) ... [2024-10-11 16:36:37,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:36:37,786 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_SAX_nondet_test4-1.i[33519,33532] [2024-10-11 16:36:37,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:36:37,982 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:36:38,043 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_SAX_nondet_test4-1.i[33519,33532] [2024-10-11 16:36:38,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:36:38,145 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:36:38,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38 WrapperNode [2024-10-11 16:36:38,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:36:38,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:36:38,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:36:38,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:36:38,154 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:36:38" (1/1) ... [2024-10-11 16:36:38,186 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:36:38" (1/1) ... [2024-10-11 16:36:38,254 INFO L138 Inliner]: procedures = 176, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1549 [2024-10-11 16:36:38,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:36:38,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:36:38,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:36:38,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:36:38,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,396 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-11 16:36:38,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:36:38,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:36:38,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:36:38,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:36:38,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (1/1) ... [2024-10-11 16:36:38,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:36:38,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:38,535 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:36:38,537 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:36:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:36:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:36:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:36:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:36:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:36:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:36:38,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:36:38,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:36:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:36:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:36:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:36:38,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:36:38,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:36:38,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:36:40,319 INFO L? ?]: Removed 377 outVars from TransFormulas that were not future-live. [2024-10-11 16:36:40,319 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:36:40,402 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:36:40,403 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-11 16:36:40,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:36:40 BoogieIcfgContainer [2024-10-11 16:36:40,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:36:40,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:36:40,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:36:40,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:36:40,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:36:37" (1/3) ... [2024-10-11 16:36:40,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c6f1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:36:40, skipping insertion in model container [2024-10-11 16:36:40,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:36:38" (2/3) ... [2024-10-11 16:36:40,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c6f1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:36:40, skipping insertion in model container [2024-10-11 16:36:40,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:36:40" (3/3) ... [2024-10-11 16:36:40,415 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-1.i [2024-10-11 16:36:40,431 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:36:40,431 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:36:40,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:36:40,524 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;@11c129e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:36:40,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:36:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 400 states, 391 states have (on average 1.618925831202046) internal successors, (633), 392 states have internal predecessors, (633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 16:36:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:36:40,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:40,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:36:40,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash 578279986, now seen corresponding path program 1 times [2024-10-11 16:36:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:40,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575058698] [2024-10-11 16:36:40,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:40,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:40,815 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:36:40,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:40,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575058698] [2024-10-11 16:36:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575058698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:40,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:40,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:36:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579926844] [2024-10-11 16:36:40,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:36:40,851 INFO L87 Difference]: Start difference. First operand has 400 states, 391 states have (on average 1.618925831202046) internal successors, (633), 392 states have internal predecessors, (633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:36:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:41,366 INFO L93 Difference]: Finished difference Result 1121 states and 1812 transitions. [2024-10-11 16:36:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-11 16:36:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:41,394 INFO L225 Difference]: With dead ends: 1121 [2024-10-11 16:36:41,394 INFO L226 Difference]: Without dead ends: 717 [2024-10-11 16:36:41,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:36:41,404 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 467 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:41,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1642 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-11 16:36:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-11 16:36:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 706 states have (on average 1.4560906515580736) internal successors, (1028), 706 states have internal predecessors, (1028), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1046 transitions. [2024-10-11 16:36:41,503 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1046 transitions. Word has length 9 [2024-10-11 16:36:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1046 transitions. [2024-10-11 16:36:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:36:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1046 transitions. [2024-10-11 16:36:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:36:41,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:41,514 INFO L215 NwaCegarLoop]: trace histogram [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:36:41,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:36:41,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:41,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash 447078271, now seen corresponding path program 1 times [2024-10-11 16:36:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74467567] [2024-10-11 16:36:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:42,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:36:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:36:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:36:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74467567] [2024-10-11 16:36:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74467567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:42,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:36:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639580667] [2024-10-11 16:36:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:42,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:36:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:42,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:36:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:36:42,167 INFO L87 Difference]: Start difference. First operand 717 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 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:36:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:42,621 INFO L93 Difference]: Finished difference Result 1383 states and 2021 transitions. [2024-10-11 16:36:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:36:42,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 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:36:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:42,627 INFO L225 Difference]: With dead ends: 1383 [2024-10-11 16:36:42,627 INFO L226 Difference]: Without dead ends: 725 [2024-10-11 16:36:42,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:36:42,631 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 107 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:42,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1975 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-11 16:36:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 717. [2024-10-11 16:36:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 706 states have (on average 1.4362606232294617) internal successors, (1014), 706 states have internal predecessors, (1014), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1032 transitions. [2024-10-11 16:36:42,673 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1032 transitions. Word has length 168 [2024-10-11 16:36:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:42,673 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1032 transitions. [2024-10-11 16:36:42,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 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:36:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1032 transitions. [2024-10-11 16:36:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:36:42,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:42,677 INFO L215 NwaCegarLoop]: trace histogram [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:36:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:36:42,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1383855757, now seen corresponding path program 1 times [2024-10-11 16:36:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865759075] [2024-10-11 16:36:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:36:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:36:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:36:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865759075] [2024-10-11 16:36:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865759075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:43,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:43,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:36:43,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210011806] [2024-10-11 16:36:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:43,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:36:43,018 INFO L87 Difference]: Start difference. First operand 717 states and 1032 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 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:36:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:43,378 INFO L93 Difference]: Finished difference Result 1373 states and 1988 transitions. [2024-10-11 16:36:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 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:36:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:43,385 INFO L225 Difference]: With dead ends: 1373 [2024-10-11 16:36:43,385 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 16:36:43,386 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:36:43,388 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 3 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:43,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1551 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:36:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 16:36:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2024-10-11 16:36:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 718 states have (on average 1.4289693593314763) internal successors, (1026), 718 states have internal predecessors, (1026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1044 transitions. [2024-10-11 16:36:43,418 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1044 transitions. Word has length 168 [2024-10-11 16:36:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:43,418 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1044 transitions. [2024-10-11 16:36:43,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 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:36:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1044 transitions. [2024-10-11 16:36:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:36:43,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:43,424 INFO L215 NwaCegarLoop]: trace histogram [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:36:43,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:36:43,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1794466123, now seen corresponding path program 1 times [2024-10-11 16:36:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:43,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544948236] [2024-10-11 16:36:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 16:36:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 16:36:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:36:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544948236] [2024-10-11 16:36:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544948236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:36:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645545827] [2024-10-11 16:36:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:43,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:43,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:36:43,672 INFO L87 Difference]: Start difference. First operand 729 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 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:36:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:44,085 INFO L93 Difference]: Finished difference Result 1311 states and 1888 transitions. [2024-10-11 16:36:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:44,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 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:36:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:44,090 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 16:36:44,090 INFO L226 Difference]: Without dead ends: 729 [2024-10-11 16:36:44,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:36:44,095 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 136 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:44,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1578 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:36:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-11 16:36:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 727. [2024-10-11 16:36:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 716 states have (on average 1.4287709497206704) internal successors, (1023), 716 states have internal predecessors, (1023), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1041 transitions. [2024-10-11 16:36:44,121 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1041 transitions. Word has length 168 [2024-10-11 16:36:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:44,122 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1041 transitions. [2024-10-11 16:36:44,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 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:36:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1041 transitions. [2024-10-11 16:36:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:36:44,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:44,124 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:36:44,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:44,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1608322837, now seen corresponding path program 1 times [2024-10-11 16:36:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:44,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564045895] [2024-10-11 16:36:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:36:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:36:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:36:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:36:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:36:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564045895] [2024-10-11 16:36:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564045895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:36:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191140792] [2024-10-11 16:36:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:36:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:44,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:36:44,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:36:44,583 INFO L87 Difference]: Start difference. First operand 727 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:36:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:44,932 INFO L93 Difference]: Finished difference Result 1170 states and 1680 transitions. [2024-10-11 16:36:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:36:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 181 [2024-10-11 16:36:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:44,936 INFO L225 Difference]: With dead ends: 1170 [2024-10-11 16:36:44,936 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 16:36:44,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:36:44,938 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 32 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:44,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1732 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:36:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 16:36:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2024-10-11 16:36:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 632 states have (on average 1.375) internal successors, (869), 632 states have internal predecessors, (869), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2024-10-11 16:36:44,955 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 181 [2024-10-11 16:36:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2024-10-11 16:36:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:36:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2024-10-11 16:36:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:36:44,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:44,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:36:44,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1710071927, now seen corresponding path program 1 times [2024-10-11 16:36:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213719909] [2024-10-11 16:36:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:36:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:36:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:36:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:36:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:36:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213719909] [2024-10-11 16:36:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213719909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237735750] [2024-10-11 16:36:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:46,407 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:36:46,410 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:36:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:46,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 16:36:46,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:46,979 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 22 treesize of output 7 [2024-10-11 16:36:47,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:36:47,450 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 71 treesize of output 43 [2024-10-11 16:36:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:36:47,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237735750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:47,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:36:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642891228] [2024-10-11 16:36:47,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:36:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:36:47,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:36:47,604 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:49,701 INFO L93 Difference]: Finished difference Result 1298 states and 1779 transitions. [2024-10-11 16:36:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:36:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2024-10-11 16:36:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:49,705 INFO L225 Difference]: With dead ends: 1298 [2024-10-11 16:36:49,705 INFO L226 Difference]: Without dead ends: 746 [2024-10-11 16:36:49,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:36:49,709 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 729 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:49,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 2783 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 16:36:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-11 16:36:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 675. [2024-10-11 16:36:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 664 states have (on average 1.3644578313253013) internal successors, (906), 664 states have internal predecessors, (906), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 924 transitions. [2024-10-11 16:36:49,730 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 924 transitions. Word has length 181 [2024-10-11 16:36:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:49,731 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 924 transitions. [2024-10-11 16:36:49,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 924 transitions. [2024-10-11 16:36:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:36:49,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:49,733 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 16:36:49,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:49,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2054900089, now seen corresponding path program 1 times [2024-10-11 16:36:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919874299] [2024-10-11 16:36:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 16:36:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:50,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 16:36:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 16:36:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:36:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:36:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919874299] [2024-10-11 16:36:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919874299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:36:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504216638] [2024-10-11 16:36:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:36:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:50,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:36:50,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:36:50,219 INFO L87 Difference]: Start difference. First operand 675 states and 924 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:50,534 INFO L93 Difference]: Finished difference Result 1181 states and 1620 transitions. [2024-10-11 16:36:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:36:50,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2024-10-11 16:36:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:50,538 INFO L225 Difference]: With dead ends: 1181 [2024-10-11 16:36:50,538 INFO L226 Difference]: Without dead ends: 537 [2024-10-11 16:36:50,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:36:50,540 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 11 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:50,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1429 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:36:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-11 16:36:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2024-10-11 16:36:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 1.3282442748091603) internal successors, (696), 524 states have internal predecessors, (696), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 714 transitions. [2024-10-11 16:36:50,558 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 714 transitions. Word has length 181 [2024-10-11 16:36:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:50,558 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 714 transitions. [2024-10-11 16:36:50,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 714 transitions. [2024-10-11 16:36:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 16:36:50,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:50,560 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:50,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:36:50,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:50,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1596062169, now seen corresponding path program 1 times [2024-10-11 16:36:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996652509] [2024-10-11 16:36:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:36:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:36:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:36:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:36:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:36:51,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996652509] [2024-10-11 16:36:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996652509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148665242] [2024-10-11 16:36:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:51,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:51,368 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:36:51,369 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:36:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:51,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 16:36:51,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:36:52,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148665242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:36:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404902197] [2024-10-11 16:36:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:36:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:36:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:52,009 INFO L87 Difference]: Start difference. First operand 535 states and 714 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:52,126 INFO L93 Difference]: Finished difference Result 1033 states and 1389 transitions. [2024-10-11 16:36:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:36:52,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2024-10-11 16:36:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:52,129 INFO L225 Difference]: With dead ends: 1033 [2024-10-11 16:36:52,129 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 16:36:52,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 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:36:52,131 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 13 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1047 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:36:52,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1047 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 16:36:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-10-11 16:36:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 524 states have (on average 1.3244274809160306) internal successors, (694), 524 states have internal predecessors, (694), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 712 transitions. [2024-10-11 16:36:52,144 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 712 transitions. Word has length 182 [2024-10-11 16:36:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:52,145 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 712 transitions. [2024-10-11 16:36:52,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 712 transitions. [2024-10-11 16:36:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 16:36:52,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:52,147 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,169 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:36:52,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:52,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:52,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1668622766, now seen corresponding path program 1 times [2024-10-11 16:36:52,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:52,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487590038] [2024-10-11 16:36:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:52,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:52,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:36:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:36:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 16:36:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 16:36:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:36:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487590038] [2024-10-11 16:36:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487590038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:36:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804744739] [2024-10-11 16:36:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:52,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:36:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:36:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:52,943 INFO L87 Difference]: Start difference. First operand 535 states and 712 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:53,426 INFO L93 Difference]: Finished difference Result 1038 states and 1402 transitions. [2024-10-11 16:36:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:36:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2024-10-11 16:36:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:53,429 INFO L225 Difference]: With dead ends: 1038 [2024-10-11 16:36:53,429 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:36:53,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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:36:53,431 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 6 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:53,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1652 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:36:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:36:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:36:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 530 states have (on average 1.320754716981132) internal successors, (700), 530 states have internal predecessors, (700), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 718 transitions. [2024-10-11 16:36:53,445 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 718 transitions. Word has length 183 [2024-10-11 16:36:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:53,445 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 718 transitions. [2024-10-11 16:36:53,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 718 transitions. [2024-10-11 16:36:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 16:36:53,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:53,447 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:53,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:36:53,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:53,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash 849351616, now seen corresponding path program 1 times [2024-10-11 16:36:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764466216] [2024-10-11 16:36:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:36:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:36:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:53,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 16:36:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:53,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:36:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:36:53,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764466216] [2024-10-11 16:36:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764466216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:53,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:36:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655653967] [2024-10-11 16:36:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:53,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:36:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:36:53,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:36:53,947 INFO L87 Difference]: Start difference. First operand 541 states and 718 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:54,564 INFO L93 Difference]: Finished difference Result 1044 states and 1406 transitions. [2024-10-11 16:36:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:36:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2024-10-11 16:36:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:54,567 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 16:36:54,568 INFO L226 Difference]: Without dead ends: 553 [2024-10-11 16:36:54,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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:36:54,569 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 10 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:54,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2245 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:36:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-11 16:36:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2024-10-11 16:36:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 538 states have (on average 1.3197026022304832) internal successors, (710), 538 states have internal predecessors, (710), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 16:36:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 728 transitions. [2024-10-11 16:36:54,586 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 728 transitions. Word has length 184 [2024-10-11 16:36:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:54,586 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 728 transitions. [2024-10-11 16:36:54,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:36:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 728 transitions. [2024-10-11 16:36:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 16:36:54,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:54,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:36:54,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:54,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash -20005212, now seen corresponding path program 1 times [2024-10-11 16:36:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27431604] [2024-10-11 16:36:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:36:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:36:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 16:36:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 16:36:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 16:36:55,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:55,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27431604] [2024-10-11 16:36:55,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27431604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442039421] [2024-10-11 16:36:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:55,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:55,634 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:36:55,636 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:36:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:56,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 16:36:56,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 16:36:56,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442039421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 16:36:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582894640] [2024-10-11 16:36:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:56,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:36:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:56,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:36:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:56,549 INFO L87 Difference]: Start difference. First operand 549 states and 728 transitions. Second operand has 5 states, 4 states have (on average 43.0) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:36:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:56,637 INFO L93 Difference]: Finished difference Result 1068 states and 1431 transitions. [2024-10-11 16:36:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:36:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 43.0) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 184 [2024-10-11 16:36:56,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:56,642 INFO L225 Difference]: With dead ends: 1068 [2024-10-11 16:36:56,642 INFO L226 Difference]: Without dead ends: 613 [2024-10-11 16:36:56,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:36:56,644 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 367 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:56,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1689 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:36:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-11 16:36:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 551. [2024-10-11 16:36:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 539 states have (on average 1.320964749536178) internal successors, (712), 540 states have internal predecessors, (712), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:36:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 733 transitions. [2024-10-11 16:36:56,665 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 733 transitions. Word has length 184 [2024-10-11 16:36:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 733 transitions. [2024-10-11 16:36:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 43.0) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:36:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2024-10-11 16:36:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 16:36:56,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:56,669 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,694 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:36:56,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:56,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:56,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1325539188, now seen corresponding path program 1 times [2024-10-11 16:36:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136603066] [2024-10-11 16:36:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:36:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:36:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 16:36:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:36:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136603066] [2024-10-11 16:36:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136603066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:36:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037720860] [2024-10-11 16:36:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:36:57,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:36:57,897 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:36:57,899 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:36:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:58,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 16:36:58,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:36:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 16:36:58,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:36:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037720860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:36:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-10-11 16:36:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630985851] [2024-10-11 16:36:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:58,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:36:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:58,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:36:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:36:58,784 INFO L87 Difference]: Start difference. First operand 551 states and 733 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:36:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:36:59,093 INFO L93 Difference]: Finished difference Result 922 states and 1238 transitions. [2024-10-11 16:36:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:36:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2024-10-11 16:36:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:36:59,097 INFO L225 Difference]: With dead ends: 922 [2024-10-11 16:36:59,097 INFO L226 Difference]: Without dead ends: 561 [2024-10-11 16:36:59,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:36:59,099 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 12 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:36:59,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1991 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:36:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-11 16:36:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2024-10-11 16:36:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 547 states have (on average 1.3162705667276051) internal successors, (720), 548 states have internal predecessors, (720), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:36:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 741 transitions. [2024-10-11 16:36:59,116 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 741 transitions. Word has length 188 [2024-10-11 16:36:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:36:59,117 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 741 transitions. [2024-10-11 16:36:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:36:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 741 transitions. [2024-10-11 16:36:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 16:36:59,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:36:59,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:59,142 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:36:59,323 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,SelfDestructingSolverStorable11 [2024-10-11 16:36:59,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:36:59,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:36:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash 895261904, now seen corresponding path program 1 times [2024-10-11 16:36:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:36:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063135359] [2024-10-11 16:36:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:36:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:36:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:59,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:36:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:36:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 16:36:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 16:36:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:36:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:36:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063135359] [2024-10-11 16:36:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063135359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:36:59,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:36:59,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:36:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698448813] [2024-10-11 16:36:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:36:59,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:36:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:36:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:36:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:36:59,964 INFO L87 Difference]: Start difference. First operand 559 states and 741 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:37:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:00,638 INFO L93 Difference]: Finished difference Result 944 states and 1258 transitions. [2024-10-11 16:37:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:37:00,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2024-10-11 16:37:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:00,643 INFO L225 Difference]: With dead ends: 944 [2024-10-11 16:37:00,643 INFO L226 Difference]: Without dead ends: 589 [2024-10-11 16:37:00,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:37:00,645 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 27 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:00,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2276 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:37:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-10-11 16:37:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 567. [2024-10-11 16:37:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 555 states have (on average 1.3153153153153154) internal successors, (730), 556 states have internal predecessors, (730), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:37:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 751 transitions. [2024-10-11 16:37:00,660 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 751 transitions. Word has length 189 [2024-10-11 16:37:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:00,661 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 751 transitions. [2024-10-11 16:37:00,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:37:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 751 transitions. [2024-10-11 16:37:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 16:37:00,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:00,664 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:37:00,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:00,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 942039840, now seen corresponding path program 1 times [2024-10-11 16:37:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549221410] [2024-10-11 16:37:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:37:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:37:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:37:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:01,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 16:37:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:37:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549221410] [2024-10-11 16:37:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549221410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:37:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238774522] [2024-10-11 16:37:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:01,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:37:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:37:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:37:01,434 INFO L87 Difference]: Start difference. First operand 567 states and 751 transitions. Second operand has 10 states, 10 states have (on average 17.3) internal successors, (173), 9 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:37:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:02,262 INFO L93 Difference]: Finished difference Result 953 states and 1273 transitions. [2024-10-11 16:37:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:37:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 9 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2024-10-11 16:37:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:02,265 INFO L225 Difference]: With dead ends: 953 [2024-10-11 16:37:02,265 INFO L226 Difference]: Without dead ends: 589 [2024-10-11 16:37:02,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:37:02,266 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 34 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:02,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2966 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:37:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-10-11 16:37:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2024-10-11 16:37:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 571 states have (on average 1.3134851138353765) internal successors, (750), 572 states have internal predecessors, (750), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:37:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 771 transitions. [2024-10-11 16:37:02,285 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 771 transitions. Word has length 190 [2024-10-11 16:37:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:02,285 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 771 transitions. [2024-10-11 16:37:02,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 9 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:37:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 771 transitions. [2024-10-11 16:37:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 16:37:02,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:02,288 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:02,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:37:02,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash -261460185, now seen corresponding path program 1 times [2024-10-11 16:37:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:02,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693252945] [2024-10-11 16:37:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:37:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:37:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:37:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 16:37:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 16:37:03,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:03,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693252945] [2024-10-11 16:37:03,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693252945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:37:03,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:37:03,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:37:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920368605] [2024-10-11 16:37:03,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:37:03,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:37:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:37:03,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:37:03,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:37:03,047 INFO L87 Difference]: Start difference. First operand 583 states and 771 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:37:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:37:03,545 INFO L93 Difference]: Finished difference Result 975 states and 1296 transitions. [2024-10-11 16:37:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:37:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2024-10-11 16:37:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:37:03,549 INFO L225 Difference]: With dead ends: 975 [2024-10-11 16:37:03,549 INFO L226 Difference]: Without dead ends: 601 [2024-10-11 16:37:03,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:37:03,550 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 18 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:37:03,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1976 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:37:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-11 16:37:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 589. [2024-10-11 16:37:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 577 states have (on average 1.3102253032928943) internal successors, (756), 578 states have internal predecessors, (756), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 16:37:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 777 transitions. [2024-10-11 16:37:03,567 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 777 transitions. Word has length 190 [2024-10-11 16:37:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:37:03,567 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 777 transitions. [2024-10-11 16:37:03,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:37:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 777 transitions. [2024-10-11 16:37:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 16:37:03,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:37:03,569 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:37:03,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:37:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:37:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1673815219, now seen corresponding path program 1 times [2024-10-11 16:37:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:37:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612640061] [2024-10-11 16:37:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:37:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:37:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:37:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:04,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 16:37:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 16:37:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 16:37:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:37:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612640061] [2024-10-11 16:37:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612640061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:37:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226899391] [2024-10-11 16:37:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:37:04,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:37:04,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:37:04,518 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:37:04,520 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:37:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:37:05,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 237 conjuncts are in the unsatisfiable core [2024-10-11 16:37:05,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:37:05,640 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:37:05,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-11 16:37:06,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-10-11 16:37:06,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-10-11 16:37:06,163 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:37:06,167 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 23 treesize of output 11 [2024-10-11 16:37:06,174 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:37:06,194 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-11 16:37:06,195 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:37:06,282 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:37:06,288 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:37:06,292 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:37:06,488 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 16:37:06,489 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 66 treesize of output 57 [2024-10-11 16:37:06,498 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 [2024-10-11 16:37:06,508 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