./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_label46+token_ring.08.cil-2.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_label46+token_ring.08.cil-2.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 fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:03:04,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:03:05,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:03:05,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:03:05,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:03:05,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:03:05,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:03:05,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:03:05,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:03:05,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:03:05,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:03:05,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:03:05,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:03:05,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:03:05,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:03:05,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:03:05,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:03:05,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:03:05,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:03:05,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:03:05,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:03:05,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:03:05,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:03:05,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:03:05,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:03:05,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:03:05,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:03:05,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:03:05,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:03:05,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:03:05,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:03:05,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:03:05,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:03:05,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:03:05,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:03:05,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:03:05,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:03:05,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:03:05,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:03:05,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:03:05,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:03:05,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:03:05,043 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 -> fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 [2024-10-12 21:03:05,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:03:05,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:03:05,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:03:05,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:03:05,322 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:03:05,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2024-10-12 21:03:06,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:03:07,376 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:03:07,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2024-10-12 21:03:07,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106d441cd/299e3f9737574ec4a659bf3dec1e6210/FLAGcd0da8b4e [2024-10-12 21:03:07,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106d441cd/299e3f9737574ec4a659bf3dec1e6210 [2024-10-12 21:03:07,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:03:07,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:03:07,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:03:07,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:03:07,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:03:07,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:03:07" (1/1) ... [2024-10-12 21:03:07,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d30db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:07, skipping insertion in model container [2024-10-12 21:03:07,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:03:07" (1/1) ... [2024-10-12 21:03:07,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:03:09,421 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_label46+token_ring.08.cil-2.c[382357,382370] [2024-10-12 21:03:09,449 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_label46+token_ring.08.cil-2.c[383339,383352] [2024-10-12 21:03:09,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:03:09,681 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:03:10,477 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_label46+token_ring.08.cil-2.c[382357,382370] [2024-10-12 21:03:10,480 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_label46+token_ring.08.cil-2.c[383339,383352] [2024-10-12 21:03:10,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:03:10,564 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:03:10,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10 WrapperNode [2024-10-12 21:03:10,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:03:10,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:03:10,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:03:10,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:03:10,575 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:03:10" (1/1) ... [2024-10-12 21:03:10,683 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:03:10" (1/1) ... [2024-10-12 21:03:11,230 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12999 [2024-10-12 21:03:11,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:03:11,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:03:11,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:03:11,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:03:11,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:11,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:11,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:11,504 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:03:11,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:11,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:11,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:11,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:12,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:12,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:12,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:03:12,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:03:12,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:03:12,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:03:12,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (1/1) ... [2024-10-12 21:03:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:03:12,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:03:12,122 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:03:12,128 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:03:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:03:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:03:12,177 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:03:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:03:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:03:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:03:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:03:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 21:03:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 21:03:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:03:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:03:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:03:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:03:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:03:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:03:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:03:12,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:03:12,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:03:12,288 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:03:12,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:03:20,119 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-10-12 21:03:20,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:03:20,261 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:03:20,262 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-12 21:03:20,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:03:20 BoogieIcfgContainer [2024-10-12 21:03:20,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:03:20,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:03:20,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:03:20,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:03:20,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:03:07" (1/3) ... [2024-10-12 21:03:20,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acad952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:03:20, skipping insertion in model container [2024-10-12 21:03:20,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:03:10" (2/3) ... [2024-10-12 21:03:20,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acad952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:03:20, skipping insertion in model container [2024-10-12 21:03:20,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:03:20" (3/3) ... [2024-10-12 21:03:20,275 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.08.cil-2.c [2024-10-12 21:03:20,294 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:03:20,294 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:03:20,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:03:20,432 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;@3068ce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:03:20,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:03:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 21:03:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:20,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:20,474 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] [2024-10-12 21:03:20,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:20,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2069738272, now seen corresponding path program 1 times [2024-10-12 21:03:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835184726] [2024-10-12 21:03:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:21,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:21,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:21,157 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:03:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835184726] [2024-10-12 21:03:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835184726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:21,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:03:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627620436] [2024-10-12 21:03:21,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:21,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:03:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:21,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:03:21,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:03:21,205 INFO L87 Difference]: Start difference. First operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:22,756 INFO L93 Difference]: Finished difference Result 4859 states and 9094 transitions. [2024-10-12 21:03:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:03:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:22,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:22,792 INFO L225 Difference]: With dead ends: 4859 [2024-10-12 21:03:22,792 INFO L226 Difference]: Without dead ends: 2472 [2024-10-12 21:03:22,805 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:03:22,809 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 709 mSDsluCounter, 12134 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 16326 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:22,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 16326 Invalid, 811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:03:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2024-10-12 21:03:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2382. [2024-10-12 21:03:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2350 states have (on average 1.8429787234042554) internal successors, (4331), 2353 states have internal predecessors, (4331), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 21:03:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4377 transitions. [2024-10-12 21:03:22,982 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4377 transitions. Word has length 122 [2024-10-12 21:03:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:22,983 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 4377 transitions. [2024-10-12 21:03:22,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4377 transitions. [2024-10-12 21:03:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:22,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:22,989 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] [2024-10-12 21:03:22,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:03:22,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:22,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 140806046, now seen corresponding path program 1 times [2024-10-12 21:03:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272309779] [2024-10-12 21:03:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:23,367 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:03:23,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:23,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272309779] [2024-10-12 21:03:23,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272309779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:23,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:03:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773457063] [2024-10-12 21:03:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:23,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:03:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:23,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:03:23,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:03:23,372 INFO L87 Difference]: Start difference. First operand 2382 states and 4377 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:25,724 INFO L93 Difference]: Finished difference Result 3067 states and 5511 transitions. [2024-10-12 21:03:25,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:03:25,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:25,744 INFO L225 Difference]: With dead ends: 3067 [2024-10-12 21:03:25,745 INFO L226 Difference]: Without dead ends: 2820 [2024-10-12 21:03:25,748 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:03:25,750 INFO L432 NwaCegarLoop]: 4165 mSDtfsCounter, 5014 mSDsluCounter, 12483 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5029 SdHoareTripleChecker+Valid, 16648 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:25,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5029 Valid, 16648 Invalid, 1727 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [100 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:03:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2024-10-12 21:03:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2639. [2024-10-12 21:03:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2583 states have (on average 1.8246225319396052) internal successors, (4713), 2587 states have internal predecessors, (4713), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-12 21:03:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4796 transitions. [2024-10-12 21:03:25,855 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4796 transitions. Word has length 122 [2024-10-12 21:03:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:25,856 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 4796 transitions. [2024-10-12 21:03:25,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4796 transitions. [2024-10-12 21:03:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:25,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:25,860 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] [2024-10-12 21:03:25,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:03:25,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:25,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -135119266, now seen corresponding path program 1 times [2024-10-12 21:03:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866151426] [2024-10-12 21:03:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:25,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:26,138 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:03:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:26,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866151426] [2024-10-12 21:03:26,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866151426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:26,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937656693] [2024-10-12 21:03:26,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:26,145 INFO L87 Difference]: Start difference. First operand 2639 states and 4796 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:29,165 INFO L93 Difference]: Finished difference Result 3682 states and 6521 transitions. [2024-10-12 21:03:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:03:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:29,183 INFO L225 Difference]: With dead ends: 3682 [2024-10-12 21:03:29,184 INFO L226 Difference]: Without dead ends: 3178 [2024-10-12 21:03:29,187 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:03:29,189 INFO L432 NwaCegarLoop]: 4322 mSDtfsCounter, 5033 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5048 SdHoareTripleChecker+Valid, 21346 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:29,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5048 Valid, 21346 Invalid, 2710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:03:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-10-12 21:03:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2877. [2024-10-12 21:03:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2797 states have (on average 1.8080085806220951) internal successors, (5057), 2802 states have internal predecessors, (5057), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 21:03:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 5176 transitions. [2024-10-12 21:03:29,296 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 5176 transitions. Word has length 122 [2024-10-12 21:03:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:29,297 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 5176 transitions. [2024-10-12 21:03:29,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 5176 transitions. [2024-10-12 21:03:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:29,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:29,302 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] [2024-10-12 21:03:29,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:03:29,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1254174748, now seen corresponding path program 1 times [2024-10-12 21:03:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449694237] [2024-10-12 21:03:29,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:29,577 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:03:29,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449694237] [2024-10-12 21:03:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449694237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:29,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:29,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:29,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769703657] [2024-10-12 21:03:29,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:29,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:29,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:29,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:29,583 INFO L87 Difference]: Start difference. First operand 2877 states and 5176 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:31,786 INFO L93 Difference]: Finished difference Result 4583 states and 7993 transitions. [2024-10-12 21:03:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:03:31,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:31,807 INFO L225 Difference]: With dead ends: 4583 [2024-10-12 21:03:31,809 INFO L226 Difference]: Without dead ends: 3841 [2024-10-12 21:03:31,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:03:31,816 INFO L432 NwaCegarLoop]: 4174 mSDtfsCounter, 5113 mSDsluCounter, 16625 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 20799 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:31,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5128 Valid, 20799 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2024-10-12 21:03:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3354. [2024-10-12 21:03:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7811531308121513) internal successors, (5746), 3233 states have internal predecessors, (5746), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 21:03:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5941 transitions. [2024-10-12 21:03:31,958 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5941 transitions. Word has length 122 [2024-10-12 21:03:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:31,958 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5941 transitions. [2024-10-12 21:03:31,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5941 transitions. [2024-10-12 21:03:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:31,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:31,961 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] [2024-10-12 21:03:31,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:03:31,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:31,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash -779219298, now seen corresponding path program 1 times [2024-10-12 21:03:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601058503] [2024-10-12 21:03:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:32,295 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:03:32,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601058503] [2024-10-12 21:03:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601058503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:32,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374175404] [2024-10-12 21:03:32,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:32,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:32,303 INFO L87 Difference]: Start difference. First operand 3354 states and 5941 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:33,856 INFO L93 Difference]: Finished difference Result 5048 states and 8749 transitions. [2024-10-12 21:03:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:33,875 INFO L225 Difference]: With dead ends: 5048 [2024-10-12 21:03:33,875 INFO L226 Difference]: Without dead ends: 3829 [2024-10-12 21:03:33,882 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:03:33,883 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4742 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4758 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:33,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4758 Valid, 20576 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:03:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2024-10-12 21:03:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3354. [2024-10-12 21:03:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7796032238065715) internal successors, (5741), 3233 states have internal predecessors, (5741), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 21:03:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5936 transitions. [2024-10-12 21:03:34,058 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5936 transitions. Word has length 122 [2024-10-12 21:03:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:34,059 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5936 transitions. [2024-10-12 21:03:34,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5936 transitions. [2024-10-12 21:03:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:34,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:34,063 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] [2024-10-12 21:03:34,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:03:34,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:34,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1649039324, now seen corresponding path program 1 times [2024-10-12 21:03:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427863829] [2024-10-12 21:03:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:34,330 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:03:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427863829] [2024-10-12 21:03:34,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427863829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:34,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:34,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938381492] [2024-10-12 21:03:34,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:34,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:34,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:34,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:34,334 INFO L87 Difference]: Start difference. First operand 3354 states and 5936 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:35,531 INFO L93 Difference]: Finished difference Result 5037 states and 8713 transitions. [2024-10-12 21:03:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:35,549 INFO L225 Difference]: With dead ends: 5037 [2024-10-12 21:03:35,549 INFO L226 Difference]: Without dead ends: 3818 [2024-10-12 21:03:35,556 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:03:35,557 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4848 mSDsluCounter, 12339 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 16491 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:35,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 16491 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:03:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-10-12 21:03:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3354. [2024-10-12 21:03:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.778053316800992) internal successors, (5736), 3233 states have internal predecessors, (5736), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 21:03:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5931 transitions. [2024-10-12 21:03:35,745 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5931 transitions. Word has length 122 [2024-10-12 21:03:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:35,745 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5931 transitions. [2024-10-12 21:03:35,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5931 transitions. [2024-10-12 21:03:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:35,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:35,748 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] [2024-10-12 21:03:35,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:03:35,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:35,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash -748431206, now seen corresponding path program 1 times [2024-10-12 21:03:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:35,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650003649] [2024-10-12 21:03:35,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:35,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:36,025 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:03:36,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:36,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650003649] [2024-10-12 21:03:36,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650003649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:36,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:36,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136059480] [2024-10-12 21:03:36,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:36,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:36,029 INFO L87 Difference]: Start difference. First operand 3354 states and 5931 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:38,546 INFO L93 Difference]: Finished difference Result 6295 states and 10728 transitions. [2024-10-12 21:03:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:03:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:38,581 INFO L225 Difference]: With dead ends: 6295 [2024-10-12 21:03:38,585 INFO L226 Difference]: Without dead ends: 5076 [2024-10-12 21:03:38,594 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:03:38,594 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5016 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:38,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 21344 Invalid, 2633 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:03:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2024-10-12 21:03:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 4323. [2024-10-12 21:03:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.738716760185411) internal successors, (7127), 4110 states have internal predecessors, (7127), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-12 21:03:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7480 transitions. [2024-10-12 21:03:38,888 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7480 transitions. Word has length 122 [2024-10-12 21:03:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:38,888 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7480 transitions. [2024-10-12 21:03:38,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7480 transitions. [2024-10-12 21:03:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:38,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:38,891 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] [2024-10-12 21:03:38,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:03:38,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:38,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash 282609692, now seen corresponding path program 1 times [2024-10-12 21:03:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427413210] [2024-10-12 21:03:38,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:39,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:39,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:39,085 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:03:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427413210] [2024-10-12 21:03:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427413210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:39,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130918427] [2024-10-12 21:03:39,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:39,091 INFO L87 Difference]: Start difference. First operand 4323 states and 7480 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:40,407 INFO L93 Difference]: Finished difference Result 7271 states and 12318 transitions. [2024-10-12 21:03:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:03:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:40,425 INFO L225 Difference]: With dead ends: 7271 [2024-10-12 21:03:40,425 INFO L226 Difference]: Without dead ends: 5083 [2024-10-12 21:03:40,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:03:40,435 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4738 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:40,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 20576 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:03:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2024-10-12 21:03:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4323. [2024-10-12 21:03:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.7365211027079777) internal successors, (7118), 4110 states have internal predecessors, (7118), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-12 21:03:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7471 transitions. [2024-10-12 21:03:40,623 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7471 transitions. Word has length 122 [2024-10-12 21:03:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7471 transitions. [2024-10-12 21:03:40,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7471 transitions. [2024-10-12 21:03:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:40,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:40,627 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] [2024-10-12 21:03:40,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:03:40,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1623793574, now seen corresponding path program 1 times [2024-10-12 21:03:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412231627] [2024-10-12 21:03:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:40,842 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:03:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412231627] [2024-10-12 21:03:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412231627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:40,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12578836] [2024-10-12 21:03:40,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:40,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:40,845 INFO L87 Difference]: Start difference. First operand 4323 states and 7471 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:43,185 INFO L93 Difference]: Finished difference Result 9746 states and 16269 transitions. [2024-10-12 21:03:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:03:43,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:43,290 INFO L225 Difference]: With dead ends: 9746 [2024-10-12 21:03:43,290 INFO L226 Difference]: Without dead ends: 7558 [2024-10-12 21:03:43,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:03:43,298 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5008 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5023 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:43,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5023 Valid, 21344 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:03:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-12 21:03:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6271. [2024-10-12 21:03:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6271 states, 5855 states have (on average 1.690862510674637) internal successors, (9900), 5874 states have internal predecessors, (9900), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-12 21:03:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 10587 transitions. [2024-10-12 21:03:43,588 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 10587 transitions. Word has length 122 [2024-10-12 21:03:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:43,590 INFO L471 AbstractCegarLoop]: Abstraction has 6271 states and 10587 transitions. [2024-10-12 21:03:43,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 10587 transitions. [2024-10-12 21:03:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:43,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:43,594 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] [2024-10-12 21:03:43,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:03:43,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:43,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -22722468, now seen corresponding path program 1 times [2024-10-12 21:03:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071533301] [2024-10-12 21:03:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:43,787 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:03:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071533301] [2024-10-12 21:03:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071533301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043488356] [2024-10-12 21:03:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:43,789 INFO L87 Difference]: Start difference. First operand 6271 states and 10587 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:46,490 INFO L93 Difference]: Finished difference Result 18328 states and 30157 transitions. [2024-10-12 21:03:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:46,547 INFO L225 Difference]: With dead ends: 18328 [2024-10-12 21:03:46,548 INFO L226 Difference]: Without dead ends: 14192 [2024-10-12 21:03:46,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:46,568 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5301 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5325 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:46,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5325 Valid, 21337 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:03:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14192 states. [2024-10-12 21:03:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14192 to 10148. [2024-10-12 21:03:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10148 states, 9364 states have (on average 1.6516445963263562) internal successors, (15466), 9399 states have internal predecessors, (15466), 552 states have call successors, (552), 199 states have call predecessors, (552), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-12 21:03:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10148 states to 10148 states and 16843 transitions. [2024-10-12 21:03:47,215 INFO L78 Accepts]: Start accepts. Automaton has 10148 states and 16843 transitions. Word has length 122 [2024-10-12 21:03:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:47,216 INFO L471 AbstractCegarLoop]: Abstraction has 10148 states and 16843 transitions. [2024-10-12 21:03:47,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10148 states and 16843 transitions. [2024-10-12 21:03:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:47,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:47,223 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] [2024-10-12 21:03:47,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:03:47,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:47,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1079453670, now seen corresponding path program 1 times [2024-10-12 21:03:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:47,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149660071] [2024-10-12 21:03:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:47,414 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:03:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149660071] [2024-10-12 21:03:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149660071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:47,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:47,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586274189] [2024-10-12 21:03:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:47,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:47,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:47,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:47,417 INFO L87 Difference]: Start difference. First operand 10148 states and 16843 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:51,170 INFO L93 Difference]: Finished difference Result 33379 states and 54727 transitions. [2024-10-12 21:03:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:51,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:51,267 INFO L225 Difference]: With dead ends: 33379 [2024-10-12 21:03:51,267 INFO L226 Difference]: Without dead ends: 25366 [2024-10-12 21:03:51,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:51,302 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5136 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 20847 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:51,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 20847 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:03:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25366 states. [2024-10-12 21:03:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25366 to 17581. [2024-10-12 21:03:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17581 states, 16077 states have (on average 1.620451576786714) internal successors, (26052), 16144 states have internal predecessors, (26052), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-12 21:03:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17581 states to 17581 states and 28939 transitions. [2024-10-12 21:03:52,471 INFO L78 Accepts]: Start accepts. Automaton has 17581 states and 28939 transitions. Word has length 122 [2024-10-12 21:03:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:52,471 INFO L471 AbstractCegarLoop]: Abstraction has 17581 states and 28939 transitions. [2024-10-12 21:03:52,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17581 states and 28939 transitions. [2024-10-12 21:03:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:52,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:52,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:52,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:03:52,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:52,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 271931548, now seen corresponding path program 1 times [2024-10-12 21:03:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:52,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286481313] [2024-10-12 21:03:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:52,661 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:03:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286481313] [2024-10-12 21:03:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286481313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:52,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036473781] [2024-10-12 21:03:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:52,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:52,665 INFO L87 Difference]: Start difference. First operand 17581 states and 28939 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:56,941 INFO L93 Difference]: Finished difference Result 62074 states and 101957 transitions. [2024-10-12 21:03:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:03:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:57,346 INFO L225 Difference]: With dead ends: 62074 [2024-10-12 21:03:57,346 INFO L226 Difference]: Without dead ends: 46628 [2024-10-12 21:03:57,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:57,398 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5235 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5259 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:57,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5259 Valid, 21337 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:03:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46628 states. [2024-10-12 21:03:59,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46628 to 32766. [2024-10-12 21:03:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32766 states, 29854 states have (on average 1.603202250954646) internal successors, (47862), 29985 states have internal predecessors, (47862), 2008 states have call successors, (2008), 775 states have call predecessors, (2008), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-12 21:03:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32766 states to 32766 states and 54191 transitions. [2024-10-12 21:03:59,757 INFO L78 Accepts]: Start accepts. Automaton has 32766 states and 54191 transitions. Word has length 122 [2024-10-12 21:03:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:59,757 INFO L471 AbstractCegarLoop]: Abstraction has 32766 states and 54191 transitions. [2024-10-12 21:03:59,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:03:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32766 states and 54191 transitions. [2024-10-12 21:03:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:03:59,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:59,778 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] [2024-10-12 21:03:59,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:03:59,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1347043366, now seen corresponding path program 1 times [2024-10-12 21:03:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:59,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981430453] [2024-10-12 21:03:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:03:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:59,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:03:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:03:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:03:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:59,954 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:03:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:59,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981430453] [2024-10-12 21:03:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981430453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890144629] [2024-10-12 21:03:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:59,957 INFO L87 Difference]: Start difference. First operand 32766 states and 54191 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:04:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:04:06,887 INFO L93 Difference]: Finished difference Result 117735 states and 195799 transitions. [2024-10-12 21:04:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:04:06,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 122 [2024-10-12 21:04:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:04:07,382 INFO L225 Difference]: With dead ends: 117735 [2024-10-12 21:04:07,382 INFO L226 Difference]: Without dead ends: 87104 [2024-10-12 21:04:07,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:04:07,480 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5044 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:04:07,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 21337 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2770 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:04:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87104 states. [2024-10-12 21:04:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87104 to 63264. [2024-10-12 21:04:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63264 states, 57600 states have (on average 1.5948958333333334) internal successors, (91866), 57859 states have internal predecessors, (91866), 3864 states have call successors, (3864), 1543 states have call predecessors, (3864), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-12 21:04:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63264 states to 63264 states and 106409 transitions. [2024-10-12 21:04:12,235 INFO L78 Accepts]: Start accepts. Automaton has 63264 states and 106409 transitions. Word has length 122 [2024-10-12 21:04:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:04:12,236 INFO L471 AbstractCegarLoop]: Abstraction has 63264 states and 106409 transitions. [2024-10-12 21:04:12,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:04:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 63264 states and 106409 transitions. [2024-10-12 21:04:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 21:04:12,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:04:12,283 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] [2024-10-12 21:04:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:04:12,283 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:04:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:04:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1375543656, now seen corresponding path program 1 times [2024-10-12 21:04:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:04:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584962992] [2024-10-12 21:04:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:04:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:04:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:04:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 21:04:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:04:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 21:04:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 21:04:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:04:12,460 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:04:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:04:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584962992] [2024-10-12 21:04:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584962992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:04:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:04:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:04:12,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139379932] [2024-10-12 21:04:12,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:04:12,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:04:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:04:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:04:12,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:04:12,462 INFO L87 Difference]: Start difference. First operand 63264 states and 106409 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)