./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:07:45,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:07:45,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:07:45,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:07:45,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:07:46,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:07:46,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:07:46,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:07:46,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:07:46,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:07:46,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:07:46,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:07:46,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:07:46,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:07:46,041 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:07:46,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:07:46,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:07:46,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:07:46,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:07:46,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:07:46,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:07:46,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:07:46,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:07:46,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:07:46,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:07:46,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:07:46,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:07:46,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:07:46,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:07:46,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:07:46,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:07:46,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:07:46,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:07:46,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:07:46,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:07:46,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:07:46,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:07:46,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:07:46,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:07:46,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:07:46,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:07:46,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:07:46,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c [2024-10-12 21:07:46,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:07:46,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:07:46,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:07:46,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:07:46,328 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:07:46,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c [2024-10-12 21:07:47,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:07:48,384 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:07:48,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c [2024-10-12 21:07:48,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08220dbb4/e6224a03a8ea4075ba7a6620d5d1cfca/FLAG8a054ccd9 [2024-10-12 21:07:48,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08220dbb4/e6224a03a8ea4075ba7a6620d5d1cfca [2024-10-12 21:07:48,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:07:48,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:07:48,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:07:48,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:07:48,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:07:48,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:07:48" (1/1) ... [2024-10-12 21:07:48,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea8fdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:48, skipping insertion in model container [2024-10-12 21:07:48,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:07:48" (1/1) ... [2024-10-12 21:07:48,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:07:50,383 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/combinations/Problem05_label49+token_ring.09.cil-1.c[380593,380606] [2024-10-12 21:07:50,408 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/combinations/Problem05_label49+token_ring.09.cil-1.c[383339,383352] [2024-10-12 21:07:50,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:07:50,616 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:07:51,340 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/combinations/Problem05_label49+token_ring.09.cil-1.c[380593,380606] [2024-10-12 21:07:51,346 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/combinations/Problem05_label49+token_ring.09.cil-1.c[383339,383352] [2024-10-12 21:07:51,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:07:51,435 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:07:51,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51 WrapperNode [2024-10-12 21:07:51,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:07:51,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:07:51,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:07:51,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:07:51,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:51,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:51,975 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-10-12 21:07:51,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:07:51,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:07:51,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:07:51,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:07:51,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:51,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:07:52,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:07:52,653 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:07:52,653 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:07:52,653 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:07:52,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:07:52,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:07:52,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:07:52,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:07:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:07:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:07:52,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:07:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:07:52,801 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:07:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:07:52,801 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:07:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:07:52,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:07:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:07:52,802 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:07:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:07:52,803 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:07:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:07:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:07:52,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:07:52,949 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:07:52,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:08:00,502 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-10-12 21:08:00,503 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:08:00,626 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:08:00,626 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-12 21:08:00,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:08:00 BoogieIcfgContainer [2024-10-12 21:08:00,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:08:00,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:08:00,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:08:00,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:08:00,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:07:48" (1/3) ... [2024-10-12 21:08:00,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1b8ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:08:00, skipping insertion in model container [2024-10-12 21:08:00,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51" (2/3) ... [2024-10-12 21:08:00,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1b8ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:08:00, skipping insertion in model container [2024-10-12 21:08:00,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:08:00" (3/3) ... [2024-10-12 21:08:00,635 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.09.cil-1.c [2024-10-12 21:08:00,651 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:08:00,652 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:08:00,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:08:00,776 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;@4765d2cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:08:00,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:08:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 21:08:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:00,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:00,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:00,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:00,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1068721783, now seen corresponding path program 1 times [2024-10-12 21:08:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264738238] [2024-10-12 21:08:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,442 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-12 21:08:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264738238] [2024-10-12 21:08:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264738238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:08:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293178531] [2024-10-12 21:08:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:08:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:08:01,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:08:01,480 INFO L87 Difference]: Start difference. First operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:03,063 INFO L93 Difference]: Finished difference Result 4898 states and 9162 transitions. [2024-10-12 21:08:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:08:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:03,099 INFO L225 Difference]: With dead ends: 4898 [2024-10-12 21:08:03,100 INFO L226 Difference]: Without dead ends: 2498 [2024-10-12 21:08:03,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:08:03,119 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 764 mSDsluCounter, 12138 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 16338 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:03,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 16338 Invalid, 886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:08:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2024-10-12 21:08:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2398. [2024-10-12 21:08:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2367 states have (on average 1.8411491339247994) internal successors, (4358), 2369 states have internal predecessors, (4358), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 21:08:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4404 transitions. [2024-10-12 21:08:03,283 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4404 transitions. Word has length 131 [2024-10-12 21:08:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:03,284 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4404 transitions. [2024-10-12 21:08:03,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4404 transitions. [2024-10-12 21:08:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:03,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:03,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:03,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:08:03,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:03,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash 981687115, now seen corresponding path program 1 times [2024-10-12 21:08:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:03,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908166143] [2024-10-12 21:08:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,691 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-12 21:08:03,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:03,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908166143] [2024-10-12 21:08:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908166143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:08:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448439596] [2024-10-12 21:08:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:03,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:08:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:03,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:08:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:08:03,699 INFO L87 Difference]: Start difference. First operand 2398 states and 4404 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:06,199 INFO L93 Difference]: Finished difference Result 3135 states and 5628 transitions. [2024-10-12 21:08:06,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:08:06,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:06,216 INFO L225 Difference]: With dead ends: 3135 [2024-10-12 21:08:06,217 INFO L226 Difference]: Without dead ends: 2873 [2024-10-12 21:08:06,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:06,220 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 5107 mSDsluCounter, 12498 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5123 SdHoareTripleChecker+Valid, 16669 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:06,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5123 Valid, 16669 Invalid, 1887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 21:08:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-12 21:08:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2674. [2024-10-12 21:08:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2618 states have (on average 1.8216195569136746) internal successors, (4769), 2621 states have internal predecessors, (4769), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-10-12 21:08:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 4854 transitions. [2024-10-12 21:08:06,322 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 4854 transitions. Word has length 131 [2024-10-12 21:08:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:06,324 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 4854 transitions. [2024-10-12 21:08:06,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 4854 transitions. [2024-10-12 21:08:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:06,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:06,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:06,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:08:06,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:06,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -926603697, now seen corresponding path program 1 times [2024-10-12 21:08:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713583899] [2024-10-12 21:08:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:06,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:06,674 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-12 21:08:06,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713583899] [2024-10-12 21:08:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713583899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:06,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:06,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997553667] [2024-10-12 21:08:06,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:06,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:06,681 INFO L87 Difference]: Start difference. First operand 2674 states and 4854 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:09,705 INFO L93 Difference]: Finished difference Result 3800 states and 6722 transitions. [2024-10-12 21:08:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:09,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:09,722 INFO L225 Difference]: With dead ends: 3800 [2024-10-12 21:08:09,722 INFO L226 Difference]: Without dead ends: 3262 [2024-10-12 21:08:09,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:09,727 INFO L432 NwaCegarLoop]: 4330 mSDtfsCounter, 5140 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 21376 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:09,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 21376 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:08:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-12 21:08:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2929. [2024-10-12 21:08:09,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8040730337078652) internal successors, (5138), 2852 states have internal predecessors, (5138), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 21:08:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5261 transitions. [2024-10-12 21:08:09,828 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5261 transitions. Word has length 131 [2024-10-12 21:08:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:09,828 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5261 transitions. [2024-10-12 21:08:09,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5261 transitions. [2024-10-12 21:08:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:09,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:09,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:09,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:08:09,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:09,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -455247347, now seen corresponding path program 1 times [2024-10-12 21:08:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:09,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398051704] [2024-10-12 21:08:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:09,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,122 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-12 21:08:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398051704] [2024-10-12 21:08:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398051704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:10,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:10,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058400823] [2024-10-12 21:08:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:10,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:10,127 INFO L87 Difference]: Start difference. First operand 2929 states and 5261 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:11,637 INFO L93 Difference]: Finished difference Result 4067 states and 7159 transitions. [2024-10-12 21:08:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:11,652 INFO L225 Difference]: With dead ends: 4067 [2024-10-12 21:08:11,653 INFO L226 Difference]: Without dead ends: 3274 [2024-10-12 21:08:11,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:11,658 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4804 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4821 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:11,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4821 Valid, 20600 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:08:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-10-12 21:08:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2929. [2024-10-12 21:08:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8030196629213484) internal successors, (5135), 2852 states have internal predecessors, (5135), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 21:08:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5258 transitions. [2024-10-12 21:08:11,764 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5258 transitions. Word has length 131 [2024-10-12 21:08:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:11,765 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5258 transitions. [2024-10-12 21:08:11,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5258 transitions. [2024-10-12 21:08:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:11,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:11,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:11,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:08:11,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1708369227, now seen corresponding path program 1 times [2024-10-12 21:08:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:11,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723629205] [2024-10-12 21:08:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:11,995 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-12 21:08:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723629205] [2024-10-12 21:08:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723629205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947966707] [2024-10-12 21:08:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:11,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:11,998 INFO L87 Difference]: Start difference. First operand 2929 states and 5258 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:13,418 INFO L93 Difference]: Finished difference Result 4063 states and 7142 transitions. [2024-10-12 21:08:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:13,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:13,432 INFO L225 Difference]: With dead ends: 4063 [2024-10-12 21:08:13,432 INFO L226 Difference]: Without dead ends: 3270 [2024-10-12 21:08:13,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:13,436 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4802 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:13,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 20600 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:08:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-12 21:08:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2929. [2024-10-12 21:08:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8019662921348314) internal successors, (5132), 2852 states have internal predecessors, (5132), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 21:08:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5255 transitions. [2024-10-12 21:08:13,532 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5255 transitions. Word has length 131 [2024-10-12 21:08:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:13,532 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5255 transitions. [2024-10-12 21:08:13,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5255 transitions. [2024-10-12 21:08:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:13,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:13,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:13,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:08:13,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:13,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 669784653, now seen corresponding path program 1 times [2024-10-12 21:08:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448671009] [2024-10-12 21:08:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,807 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-12 21:08:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448671009] [2024-10-12 21:08:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448671009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:13,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536118724] [2024-10-12 21:08:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:13,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:13,811 INFO L87 Difference]: Start difference. First operand 2929 states and 5255 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:14,945 INFO L93 Difference]: Finished difference Result 4059 states and 7125 transitions. [2024-10-12 21:08:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:14,957 INFO L225 Difference]: With dead ends: 4059 [2024-10-12 21:08:14,957 INFO L226 Difference]: Without dead ends: 3266 [2024-10-12 21:08:14,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:14,961 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4919 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:14,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 16513 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:08:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2024-10-12 21:08:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2929. [2024-10-12 21:08:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8009129213483146) internal successors, (5129), 2852 states have internal predecessors, (5129), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 21:08:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5252 transitions. [2024-10-12 21:08:15,058 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5252 transitions. Word has length 131 [2024-10-12 21:08:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:15,059 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5252 transitions. [2024-10-12 21:08:15,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5252 transitions. [2024-10-12 21:08:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:15,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:15,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:15,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:08:15,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:15,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1303380725, now seen corresponding path program 1 times [2024-10-12 21:08:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814209065] [2024-10-12 21:08:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,310 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-12 21:08:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814209065] [2024-10-12 21:08:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814209065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:15,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:15,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:15,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053484370] [2024-10-12 21:08:15,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:15,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:15,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:15,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:15,312 INFO L87 Difference]: Start difference. First operand 2929 states and 5252 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:17,798 INFO L93 Difference]: Finished difference Result 4761 states and 8249 transitions. [2024-10-12 21:08:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:17,818 INFO L225 Difference]: With dead ends: 4761 [2024-10-12 21:08:17,818 INFO L226 Difference]: Without dead ends: 3968 [2024-10-12 21:08:17,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:17,826 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 5191 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5207 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:17,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5207 Valid, 20827 Invalid, 2439 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:08:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2024-10-12 21:08:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3452. [2024-10-12 21:08:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7705510388437218) internal successors, (5880), 3327 states have internal predecessors, (5880), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-12 21:08:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6083 transitions. [2024-10-12 21:08:18,010 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6083 transitions. Word has length 131 [2024-10-12 21:08:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:18,011 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6083 transitions. [2024-10-12 21:08:18,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6083 transitions. [2024-10-12 21:08:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:18,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:18,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:18,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:08:18,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:18,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash 849726093, now seen corresponding path program 1 times [2024-10-12 21:08:18,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:18,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121656994] [2024-10-12 21:08:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:18,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:18,274 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-12 21:08:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121656994] [2024-10-12 21:08:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121656994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397986724] [2024-10-12 21:08:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:18,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:18,277 INFO L87 Difference]: Start difference. First operand 3452 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:19,912 INFO L93 Difference]: Finished difference Result 5271 states and 9068 transitions. [2024-10-12 21:08:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:19,932 INFO L225 Difference]: With dead ends: 5271 [2024-10-12 21:08:19,933 INFO L226 Difference]: Without dead ends: 3955 [2024-10-12 21:08:19,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:19,941 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4918 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:19,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 16513 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:08:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2024-10-12 21:08:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3452. [2024-10-12 21:08:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7690454682324601) internal successors, (5875), 3327 states have internal predecessors, (5875), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-12 21:08:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6078 transitions. [2024-10-12 21:08:20,145 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6078 transitions. Word has length 131 [2024-10-12 21:08:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:20,146 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6078 transitions. [2024-10-12 21:08:20,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6078 transitions. [2024-10-12 21:08:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:20,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:20,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:20,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:08:20,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:20,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 226444491, now seen corresponding path program 1 times [2024-10-12 21:08:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015354349] [2024-10-12 21:08:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:20,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:20,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:20,455 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-12 21:08:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015354349] [2024-10-12 21:08:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015354349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483715252] [2024-10-12 21:08:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:20,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:20,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:20,459 INFO L87 Difference]: Start difference. First operand 3452 states and 6078 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:23,186 INFO L93 Difference]: Finished difference Result 6630 states and 11232 transitions. [2024-10-12 21:08:23,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:23,203 INFO L225 Difference]: With dead ends: 6630 [2024-10-12 21:08:23,203 INFO L226 Difference]: Without dead ends: 5314 [2024-10-12 21:08:23,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:23,210 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5105 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:23,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 21374 Invalid, 2833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 21:08:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2024-10-12 21:08:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4498. [2024-10-12 21:08:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 4267 states have (on average 1.7265057417389267) internal successors, (7367), 4277 states have internal predecessors, (7367), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-12 21:08:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 7736 transitions. [2024-10-12 21:08:23,398 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 7736 transitions. Word has length 131 [2024-10-12 21:08:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:23,399 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 7736 transitions. [2024-10-12 21:08:23,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 7736 transitions. [2024-10-12 21:08:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:23,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:23,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:08:23,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 344885965, now seen corresponding path program 1 times [2024-10-12 21:08:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131147261] [2024-10-12 21:08:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:23,632 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-12 21:08:23,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131147261] [2024-10-12 21:08:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131147261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:23,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:23,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171034999] [2024-10-12 21:08:23,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:23,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:23,634 INFO L87 Difference]: Start difference. First operand 4498 states and 7736 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:26,471 INFO L93 Difference]: Finished difference Result 10374 states and 17252 transitions. [2024-10-12 21:08:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:26,499 INFO L225 Difference]: With dead ends: 10374 [2024-10-12 21:08:26,500 INFO L226 Difference]: Without dead ends: 8012 [2024-10-12 21:08:26,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:26,513 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5110 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5126 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:26,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5126 Valid, 21374 Invalid, 2815 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:08:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2024-10-12 21:08:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 6595. [2024-10-12 21:08:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6164 states have (on average 1.6802401038286827) internal successors, (10357), 6182 states have internal predecessors, (10357), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-10-12 21:08:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 11076 transitions. [2024-10-12 21:08:26,913 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 11076 transitions. Word has length 131 [2024-10-12 21:08:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 6595 states and 11076 transitions. [2024-10-12 21:08:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 11076 transitions. [2024-10-12 21:08:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:26,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:26,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:26,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:08:26,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:26,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1734179979, now seen corresponding path program 1 times [2024-10-12 21:08:26,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:26,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314816187] [2024-10-12 21:08:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:27,125 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-12 21:08:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314816187] [2024-10-12 21:08:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314816187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:27,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:27,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788199369] [2024-10-12 21:08:27,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:27,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:27,127 INFO L87 Difference]: Start difference. First operand 6595 states and 11076 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:30,568 INFO L93 Difference]: Finished difference Result 19523 states and 32052 transitions. [2024-10-12 21:08:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:30,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:30,626 INFO L225 Difference]: With dead ends: 19523 [2024-10-12 21:08:30,626 INFO L226 Difference]: Without dead ends: 15064 [2024-10-12 21:08:30,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:30,652 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 5178 mSDsluCounter, 17038 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5193 SdHoareTripleChecker+Valid, 21363 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:30,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5193 Valid, 21363 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3229 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:08:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15064 states. [2024-10-12 21:08:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15064 to 10709. [2024-10-12 21:08:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10709 states, 9894 states have (on average 1.6423084697796644) internal successors, (16249), 9928 states have internal predecessors, (16249), 583 states have call successors, (583), 198 states have call predecessors, (583), 230 states have return successors, (858), 614 states have call predecessors, (858), 583 states have call successors, (858) [2024-10-12 21:08:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17690 transitions. [2024-10-12 21:08:31,386 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17690 transitions. Word has length 131 [2024-10-12 21:08:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:31,387 INFO L471 AbstractCegarLoop]: Abstraction has 10709 states and 17690 transitions. [2024-10-12 21:08:31,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17690 transitions. [2024-10-12 21:08:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:31,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:31,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:31,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:08:31,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -132528695, now seen corresponding path program 1 times [2024-10-12 21:08:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513283455] [2024-10-12 21:08:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:31,590 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-12 21:08:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513283455] [2024-10-12 21:08:31,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513283455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:31,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:31,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708637917] [2024-10-12 21:08:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:31,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:31,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:31,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:31,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:31,593 INFO L87 Difference]: Start difference. First operand 10709 states and 17690 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:35,621 INFO L93 Difference]: Finished difference Result 35491 states and 58044 transitions. [2024-10-12 21:08:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:35,714 INFO L225 Difference]: With dead ends: 35491 [2024-10-12 21:08:35,714 INFO L226 Difference]: Without dead ends: 26918 [2024-10-12 21:08:35,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:35,756 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5363 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5389 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:35,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5389 Valid, 21367 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:08:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26918 states. [2024-10-12 21:08:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26918 to 19014. [2024-10-12 21:08:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19014 states, 17447 states have (on average 1.6155786095030664) internal successors, (28187), 17513 states have internal predecessors, (28187), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 454 states have return successors, (1904), 1174 states have call predecessors, (1904), 1111 states have call successors, (1904) [2024-10-12 21:08:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 31202 transitions. [2024-10-12 21:08:37,091 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 31202 transitions. Word has length 131 [2024-10-12 21:08:37,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:37,092 INFO L471 AbstractCegarLoop]: Abstraction has 19014 states and 31202 transitions. [2024-10-12 21:08:37,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 31202 transitions. [2024-10-12 21:08:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:37,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:37,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:08:37,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:37,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1439671093, now seen corresponding path program 1 times [2024-10-12 21:08:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938708383] [2024-10-12 21:08:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:37,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:37,332 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-12 21:08:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938708383] [2024-10-12 21:08:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938708383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:37,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:37,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954164798] [2024-10-12 21:08:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:37,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:37,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:37,334 INFO L87 Difference]: Start difference. First operand 19014 states and 31202 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:42,103 INFO L93 Difference]: Finished difference Result 67154 states and 110194 transitions. [2024-10-12 21:08:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:42,275 INFO L225 Difference]: With dead ends: 67154 [2024-10-12 21:08:42,276 INFO L226 Difference]: Without dead ends: 50276 [2024-10-12 21:08:42,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:42,329 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5327 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5353 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:42,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5353 Valid, 21367 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:08:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50276 states. [2024-10-12 21:08:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50276 to 35623. [2024-10-12 21:08:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35623 states, 32584 states have (on average 1.599711514853916) internal successors, (52125), 32714 states have internal predecessors, (52125), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 902 states have return successors, (4450), 2262 states have call predecessors, (4450), 2135 states have call successors, (4450) [2024-10-12 21:08:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35623 states to 35623 states and 58710 transitions. [2024-10-12 21:08:44,921 INFO L78 Accepts]: Start accepts. Automaton has 35623 states and 58710 transitions. Word has length 131 [2024-10-12 21:08:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:44,922 INFO L471 AbstractCegarLoop]: Abstraction has 35623 states and 58710 transitions. [2024-10-12 21:08:44,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35623 states and 58710 transitions. [2024-10-12 21:08:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:44,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:44,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:08:44,945 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:44,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash 457825673, now seen corresponding path program 1 times [2024-10-12 21:08:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180553479] [2024-10-12 21:08:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:45,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:45,139 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-12 21:08:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180553479] [2024-10-12 21:08:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180553479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:45,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:45,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:45,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485757810] [2024-10-12 21:08:45,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:45,141 INFO L87 Difference]: Start difference. First operand 35623 states and 58710 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:52,618 INFO L93 Difference]: Finished difference Result 129521 states and 214776 transitions. [2024-10-12 21:08:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:52,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 21:08:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:53,195 INFO L225 Difference]: With dead ends: 129521 [2024-10-12 21:08:53,195 INFO L226 Difference]: Without dead ends: 96034 [2024-10-12 21:08:53,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:53,313 INFO L432 NwaCegarLoop]: 4182 mSDtfsCounter, 5211 mSDsluCounter, 16645 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5226 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:53,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5226 Valid, 20827 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 21:08:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96034 states. [2024-10-12 21:08:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96034 to 68840. [2024-10-12 21:08:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68840 states, 62921 states have (on average 1.5913129161965003) internal successors, (100127), 63179 states have internal predecessors, (100127), 4119 states have call successors, (4119), 1542 states have call predecessors, (4119), 1798 states have return successors, (10936), 4374 states have call predecessors, (10936), 4119 states have call successors, (10936) [2024-10-12 21:08:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68840 states to 68840 states and 115182 transitions. [2024-10-12 21:08:58,269 INFO L78 Accepts]: Start accepts. Automaton has 68840 states and 115182 transitions. Word has length 131 [2024-10-12 21:08:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:58,270 INFO L471 AbstractCegarLoop]: Abstraction has 68840 states and 115182 transitions. [2024-10-12 21:08:58,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:08:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 68840 states and 115182 transitions. [2024-10-12 21:08:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 21:08:58,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:58,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 21:08:58,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:08:58,314 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1488866571, now seen corresponding path program 1 times [2024-10-12 21:08:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939370500] [2024-10-12 21:08:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:58,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 21:08:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 21:08:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 21:08:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 21:08:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:58,833 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-12 21:08:58,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:58,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939370500] [2024-10-12 21:08:58,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939370500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:58,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505336276] [2024-10-12 21:08:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:58,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:58,836 INFO L87 Difference]: Start difference. First operand 68840 states and 115182 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)