./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 350eaf2863f602bf9d6d43c31d190808a06f274c6c222054e38d4c11a80535eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:07:48,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:07:48,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:07:48,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:07:48,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:07:48,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:07:48,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:07:48,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:07:48,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:07:48,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:07:48,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:07:48,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:07:48,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:07:48,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:07:48,714 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:07:48,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:07:48,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:07:48,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:07:48,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:07:48,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:07:48,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:07:48,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:07:48,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:07:48,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:07:48,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:07:48,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:07:48,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:07:48,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:07:48,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:07:48,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:07:48,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:07:48,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:07:48,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:07:48,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:07:48,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:07:48,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:07:48,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:07:48,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:07:48,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:07:48,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:07:48,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:07:48,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:07:48,723 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 -> 350eaf2863f602bf9d6d43c31d190808a06f274c6c222054e38d4c11a80535eb [2024-10-12 21:07:48,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:07:48,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:07:48,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:07:48,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:07:48,964 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:07:48,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c [2024-10-12 21:07:50,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:07:50,998 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:07:50,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c [2024-10-12 21:07:51,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb230612/d0eb6900e17a451286656dceb40d1c01/FLAG3cfc9fb17 [2024-10-12 21:07:51,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb230612/d0eb6900e17a451286656dceb40d1c01 [2024-10-12 21:07:51,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:07:51,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:07:51,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:07:51,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:07:51,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:07:51,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:51,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a8a098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:51, skipping insertion in model container [2024-10-12 21:07:51,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:07:51" (1/1) ... [2024-10-12 21:07:51,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:07:52,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c[380593,380606] [2024-10-12 21:07:52,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c[383339,383352] [2024-10-12 21:07:52,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:07:52,653 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:07:53,353 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c[380593,380606] [2024-10-12 21:07:53,359 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.10.cil-1.c[383339,383352] [2024-10-12 21:07:53,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:07:53,427 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:07:53,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53 WrapperNode [2024-10-12 21:07:53,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:07:53,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:07:53,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:07:53,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:07:53,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:53,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:53,742 INFO L138 Inliner]: procedures = 64, calls = 72, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 13119 [2024-10-12 21:07:53,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:07:53,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:07:53,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:07:53,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:07:53,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:53,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:53,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,024 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:07:54,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:07:54,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:07:54,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:07:54,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:07:54,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (1/1) ... [2024-10-12 21:07:54,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:07:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:07:54,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:07:54,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:07:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:07:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:07:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:07:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:07:54,468 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:07:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:07:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:07:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 21:07:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 21:07:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:07:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:07:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:07:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:07:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:07:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:07:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:07:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:07:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:07:54,593 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:07:54,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:08:00,778 INFO L? ?]: Removed 1747 outVars from TransFormulas that were not future-live. [2024-10-12 21:08:00,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:08:00,889 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:08:00,890 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-12 21:08:00,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:08:00 BoogieIcfgContainer [2024-10-12 21:08:00,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:08:00,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:08:00,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:08:00,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:08:00,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:07:51" (1/3) ... [2024-10-12 21:08:00,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e7ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:08:00, skipping insertion in model container [2024-10-12 21:08:00,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:07:53" (2/3) ... [2024-10-12 21:08:00,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e7ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:08:00, skipping insertion in model container [2024-10-12 21:08:00,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:08:00" (3/3) ... [2024-10-12 21:08:00,896 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.10.cil-1.c [2024-10-12 21:08:00,907 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:08:00,907 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:08:00,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:08:01,003 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;@37ac22a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:08:01,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:08:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 2433 states, 2397 states have (on average 1.8777638715060492) internal successors, (4501), 2402 states have internal predecessors, (4501), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:08:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:01,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:01,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:01,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1699658596, now seen corresponding path program 1 times [2024-10-12 21:08:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828817827] [2024-10-12 21:08:01,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:01,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828817827] [2024-10-12 21:08:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828817827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:01,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:08:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422503557] [2024-10-12 21:08:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:01,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:08:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:01,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:08:01,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:08:01,569 INFO L87 Difference]: Start difference. First operand has 2433 states, 2397 states have (on average 1.8777638715060492) internal successors, (4501), 2402 states have internal predecessors, (4501), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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:08:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:03,092 INFO L93 Difference]: Finished difference Result 4967 states and 9286 transitions. [2024-10-12 21:08:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:08:03,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:03,115 INFO L225 Difference]: With dead ends: 4967 [2024-10-12 21:08:03,116 INFO L226 Difference]: Without dead ends: 2538 [2024-10-12 21:08:03,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:08:03,126 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 851 mSDsluCounter, 12178 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:03,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 16408 Invalid, 968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:08:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-12 21:08:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2428. [2024-10-12 21:08:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2394 states have (on average 1.840016708437761) internal successors, (4405), 2397 states have internal predecessors, (4405), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 21:08:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4455 transitions. [2024-10-12 21:08:03,238 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4455 transitions. Word has length 142 [2024-10-12 21:08:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:03,238 INFO L471 AbstractCegarLoop]: Abstraction has 2428 states and 4455 transitions. [2024-10-12 21:08:03,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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:08:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4455 transitions. [2024-10-12 21:08:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:03,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:03,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:08:03,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1154786022, now seen corresponding path program 1 times [2024-10-12 21:08:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161741255] [2024-10-12 21:08:03,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161741255] [2024-10-12 21:08:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161741255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865362462] [2024-10-12 21:08:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:03,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:03,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:03,511 INFO L87 Difference]: Start difference. First operand 2428 states and 4455 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:06,763 INFO L93 Difference]: Finished difference Result 3266 states and 5862 transitions. [2024-10-12 21:08:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:06,775 INFO L225 Difference]: With dead ends: 3266 [2024-10-12 21:08:06,775 INFO L226 Difference]: Without dead ends: 2975 [2024-10-12 21:08:06,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:06,777 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5177 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5194 SdHoareTripleChecker+Valid, 21619 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:06,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5194 Valid, 21619 Invalid, 3373 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:08:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2024-10-12 21:08:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2736. [2024-10-12 21:08:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2673 states have (on average 1.8204264870931537) internal successors, (4866), 2678 states have internal predecessors, (4866), 47 states have call successors, (47), 13 states have call predecessors, (47), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-12 21:08:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 4965 transitions. [2024-10-12 21:08:06,942 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 4965 transitions. Word has length 142 [2024-10-12 21:08:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:06,943 INFO L471 AbstractCegarLoop]: Abstraction has 2736 states and 4965 transitions. [2024-10-12 21:08:06,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 4965 transitions. [2024-10-12 21:08:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:06,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:06,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:06,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:08:06,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:06,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1089772376, now seen corresponding path program 1 times [2024-10-12 21:08:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:06,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781485504] [2024-10-12 21:08:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:07,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781485504] [2024-10-12 21:08:07,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781485504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:07,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:07,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:07,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846287324] [2024-10-12 21:08:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:07,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:07,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:07,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:07,264 INFO L87 Difference]: Start difference. First operand 2736 states and 4965 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:10,085 INFO L93 Difference]: Finished difference Result 4324 states and 7612 transitions. [2024-10-12 21:08:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:10,109 INFO L225 Difference]: With dead ends: 4324 [2024-10-12 21:08:10,109 INFO L226 Difference]: Without dead ends: 3727 [2024-10-12 21:08:10,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:10,112 INFO L432 NwaCegarLoop]: 4334 mSDtfsCounter, 5218 mSDsluCounter, 17172 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5235 SdHoareTripleChecker+Valid, 21506 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:10,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5235 Valid, 21506 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:08:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2024-10-12 21:08:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3300. [2024-10-12 21:08:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.7886970172684458) internal successors, (5697), 3192 states have internal predecessors, (5697), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 21:08:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5882 transitions. [2024-10-12 21:08:10,188 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5882 transitions. Word has length 142 [2024-10-12 21:08:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:10,188 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5882 transitions. [2024-10-12 21:08:10,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5882 transitions. [2024-10-12 21:08:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:10,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:10,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:10,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:08:10,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:10,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1577819482, now seen corresponding path program 1 times [2024-10-12 21:08:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:10,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631025228] [2024-10-12 21:08:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631025228] [2024-10-12 21:08:10,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631025228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:10,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:10,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615785055] [2024-10-12 21:08:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:10,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:10,395 INFO L87 Difference]: Start difference. First operand 3300 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:11,901 INFO L93 Difference]: Finished difference Result 4901 states and 8568 transitions. [2024-10-12 21:08:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:11,913 INFO L225 Difference]: With dead ends: 4901 [2024-10-12 21:08:11,913 INFO L226 Difference]: Without dead ends: 3738 [2024-10-12 21:08:11,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:11,916 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4885 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:11,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 20718 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:08:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2024-10-12 21:08:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3300. [2024-10-12 21:08:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.78712715855573) internal successors, (5692), 3192 states have internal predecessors, (5692), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 21:08:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5877 transitions. [2024-10-12 21:08:11,998 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5877 transitions. Word has length 142 [2024-10-12 21:08:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:11,999 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5877 transitions. [2024-10-12 21:08:11,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5877 transitions. [2024-10-12 21:08:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:12,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:12,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:12,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:08:12,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 485184280, now seen corresponding path program 1 times [2024-10-12 21:08:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:12,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103966202] [2024-10-12 21:08:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103966202] [2024-10-12 21:08:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103966202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:12,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511938886] [2024-10-12 21:08:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:12,185 INFO L87 Difference]: Start difference. First operand 3300 states and 5877 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:13,537 INFO L93 Difference]: Finished difference Result 4897 states and 8547 transitions. [2024-10-12 21:08:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:13,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:13,549 INFO L225 Difference]: With dead ends: 4897 [2024-10-12 21:08:13,549 INFO L226 Difference]: Without dead ends: 3734 [2024-10-12 21:08:13,552 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:08:13,552 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4883 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:13,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 20718 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:08:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2024-10-12 21:08:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3300. [2024-10-12 21:08:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.785557299843014) internal successors, (5687), 3192 states have internal predecessors, (5687), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 21:08:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5872 transitions. [2024-10-12 21:08:13,627 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5872 transitions. Word has length 142 [2024-10-12 21:08:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:13,627 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5872 transitions. [2024-10-12 21:08:13,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5872 transitions. [2024-10-12 21:08:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:13,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:13,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:13,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:08:13,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:13,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash -796988006, now seen corresponding path program 1 times [2024-10-12 21:08:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697582131] [2024-10-12 21:08:13,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697582131] [2024-10-12 21:08:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697582131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:13,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622400579] [2024-10-12 21:08:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:13,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:13,912 INFO L87 Difference]: Start difference. First operand 3300 states and 5872 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:15,303 INFO L93 Difference]: Finished difference Result 4892 states and 8524 transitions. [2024-10-12 21:08:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:15,314 INFO L225 Difference]: With dead ends: 4892 [2024-10-12 21:08:15,314 INFO L226 Difference]: Without dead ends: 3729 [2024-10-12 21:08:15,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:15,317 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4881 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4899 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:15,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4899 Valid, 20718 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:08:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-12 21:08:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3300. [2024-10-12 21:08:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.7839874411302983) internal successors, (5682), 3192 states have internal predecessors, (5682), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-12 21:08:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5867 transitions. [2024-10-12 21:08:15,389 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5867 transitions. Word has length 142 [2024-10-12 21:08:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:15,389 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5867 transitions. [2024-10-12 21:08:15,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5867 transitions. [2024-10-12 21:08:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:15,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:15,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:15,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:08:15,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:15,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1655503576, now seen corresponding path program 1 times [2024-10-12 21:08:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250590229] [2024-10-12 21:08:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:15,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:15,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250590229] [2024-10-12 21:08:15,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250590229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:15,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:15,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15637443] [2024-10-12 21:08:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:15,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:15,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:15,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:15,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:15,596 INFO L87 Difference]: Start difference. First operand 3300 states and 5867 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:18,711 INFO L93 Difference]: Finished difference Result 6373 states and 10927 transitions. [2024-10-12 21:08:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:18,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:18,728 INFO L225 Difference]: With dead ends: 6373 [2024-10-12 21:08:18,729 INFO L226 Difference]: Without dead ends: 5212 [2024-10-12 21:08:18,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:18,736 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5168 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5185 SdHoareTripleChecker+Valid, 21616 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:18,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5185 Valid, 21616 Invalid, 3281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:08:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2024-10-12 21:08:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4439. [2024-10-12 21:08:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4220 states have (on average 1.740047393364929) internal successors, (7343), 4231 states have internal predecessors, (7343), 161 states have call successors, (161), 49 states have call predecessors, (161), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-12 21:08:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7706 transitions. [2024-10-12 21:08:18,960 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7706 transitions. Word has length 142 [2024-10-12 21:08:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:18,960 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 7706 transitions. [2024-10-12 21:08:18,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7706 transitions. [2024-10-12 21:08:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:18,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:18,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:18,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:08:18,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:18,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash -66499110, now seen corresponding path program 1 times [2024-10-12 21:08:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442774142] [2024-10-12 21:08:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442774142] [2024-10-12 21:08:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442774142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:19,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:19,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346474081] [2024-10-12 21:08:19,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:19,257 INFO L87 Difference]: Start difference. First operand 4439 states and 7706 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:21,338 INFO L93 Difference]: Finished difference Result 7548 states and 12863 transitions. [2024-10-12 21:08:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:08:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:21,358 INFO L225 Difference]: With dead ends: 7548 [2024-10-12 21:08:21,358 INFO L226 Difference]: Without dead ends: 5246 [2024-10-12 21:08:21,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:08:21,364 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4885 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:21,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 20718 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:08:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2024-10-12 21:08:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4439. [2024-10-12 21:08:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4220 states have (on average 1.7379146919431279) internal successors, (7334), 4231 states have internal predecessors, (7334), 161 states have call successors, (161), 49 states have call predecessors, (161), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-12 21:08:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7697 transitions. [2024-10-12 21:08:21,508 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7697 transitions. Word has length 142 [2024-10-12 21:08:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:21,509 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 7697 transitions. [2024-10-12 21:08:21,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7697 transitions. [2024-10-12 21:08:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:21,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:21,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:21,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:08:21,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:21,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -399142248, now seen corresponding path program 1 times [2024-10-12 21:08:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:21,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725619012] [2024-10-12 21:08:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725619012] [2024-10-12 21:08:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725619012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:21,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644324083] [2024-10-12 21:08:21,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:21,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:21,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:21,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:21,667 INFO L87 Difference]: Start difference. First operand 4439 states and 7697 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:24,441 INFO L93 Difference]: Finished difference Result 10480 states and 17612 transitions. [2024-10-12 21:08:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:24,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:24,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:24,461 INFO L225 Difference]: With dead ends: 10480 [2024-10-12 21:08:24,461 INFO L226 Difference]: Without dead ends: 8180 [2024-10-12 21:08:24,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:24,468 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5200 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5217 SdHoareTripleChecker+Valid, 21616 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:24,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5217 Valid, 21616 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:08:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2024-10-12 21:08:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 6739. [2024-10-12 21:08:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6739 states, 6312 states have (on average 1.692173637515843) internal successors, (10681), 6331 states have internal predecessors, (10681), 313 states have call successors, (313), 97 states have call predecessors, (313), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-12 21:08:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 11418 transitions. [2024-10-12 21:08:24,695 INFO L78 Accepts]: Start accepts. Automaton has 6739 states and 11418 transitions. Word has length 142 [2024-10-12 21:08:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 6739 states and 11418 transitions. [2024-10-12 21:08:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6739 states and 11418 transitions. [2024-10-12 21:08:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:24,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:24,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:08:24,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1602744022, now seen corresponding path program 1 times [2024-10-12 21:08:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755524717] [2024-10-12 21:08:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755524717] [2024-10-12 21:08:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755524717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055089226] [2024-10-12 21:08:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:24,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:24,865 INFO L87 Difference]: Start difference. First operand 6739 states and 11418 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:27,875 INFO L93 Difference]: Finished difference Result 18724 states and 31133 transitions. [2024-10-12 21:08:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:08:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:27,910 INFO L225 Difference]: With dead ends: 18724 [2024-10-12 21:08:27,910 INFO L226 Difference]: Without dead ends: 14124 [2024-10-12 21:08:27,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:08:27,926 INFO L432 NwaCegarLoop]: 4333 mSDtfsCounter, 5226 mSDsluCounter, 17172 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5243 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:27,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5243 Valid, 21505 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:08:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14124 states. [2024-10-12 21:08:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14124 to 11355. [2024-10-12 21:08:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11355 states, 10512 states have (on average 1.65515601217656) internal successors, (17399), 10547 states have internal predecessors, (17399), 617 states have call successors, (617), 193 states have call predecessors, (617), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-12 21:08:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 18938 transitions. [2024-10-12 21:08:28,346 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 18938 transitions. Word has length 142 [2024-10-12 21:08:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:28,347 INFO L471 AbstractCegarLoop]: Abstraction has 11355 states and 18938 transitions. [2024-10-12 21:08:28,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 18938 transitions. [2024-10-12 21:08:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:28,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:28,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:08:28,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash -965078312, now seen corresponding path program 1 times [2024-10-12 21:08:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485006863] [2024-10-12 21:08:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485006863] [2024-10-12 21:08:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485006863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:28,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:28,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:28,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966249112] [2024-10-12 21:08:28,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:28,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:28,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:28,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:28,510 INFO L87 Difference]: Start difference. First operand 11355 states and 18938 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:32,216 INFO L93 Difference]: Finished difference Result 39308 states and 64993 transitions. [2024-10-12 21:08:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:32,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:32,295 INFO L225 Difference]: With dead ends: 39308 [2024-10-12 21:08:32,296 INFO L226 Difference]: Without dead ends: 30092 [2024-10-12 21:08:32,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:32,332 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5566 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5594 SdHoareTripleChecker+Valid, 21611 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:32,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5594 Valid, 21611 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:08:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30092 states. [2024-10-12 21:08:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30092 to 20555. [2024-10-12 21:08:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20555 states, 18912 states have (on average 1.6312923011844331) internal successors, (30851), 18979 states have internal predecessors, (30851), 1193 states have call successors, (1193), 385 states have call predecessors, (1193), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-12 21:08:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20555 states to 20555 states and 34092 transitions. [2024-10-12 21:08:33,364 INFO L78 Accepts]: Start accepts. Automaton has 20555 states and 34092 transitions. Word has length 142 [2024-10-12 21:08:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:33,364 INFO L471 AbstractCegarLoop]: Abstraction has 20555 states and 34092 transitions. [2024-10-12 21:08:33,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20555 states and 34092 transitions. [2024-10-12 21:08:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:33,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:33,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:08:33,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash -493721962, now seen corresponding path program 1 times [2024-10-12 21:08:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605721032] [2024-10-12 21:08:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:33,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:33,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605721032] [2024-10-12 21:08:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605721032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461070657] [2024-10-12 21:08:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:33,533 INFO L87 Difference]: Start difference. First operand 20555 states and 34092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:38,864 INFO L93 Difference]: Finished difference Result 75484 states and 125245 transitions. [2024-10-12 21:08:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:38,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:39,010 INFO L225 Difference]: With dead ends: 75484 [2024-10-12 21:08:39,010 INFO L226 Difference]: Without dead ends: 57068 [2024-10-12 21:08:39,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:39,058 INFO L432 NwaCegarLoop]: 4376 mSDtfsCounter, 5285 mSDsluCounter, 17228 mSDsCounter, 0 mSdLazyCounter, 3603 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21604 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:39,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21604 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3603 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:08:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2024-10-12 21:08:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 38315. [2024-10-12 21:08:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38315 states, 35104 states have (on average 1.614260483135825) internal successors, (56667), 35235 states have internal predecessors, (56667), 2313 states have call successors, (2313), 769 states have call predecessors, (2313), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-12 21:08:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38315 states to 38315 states and 63734 transitions. [2024-10-12 21:08:41,213 INFO L78 Accepts]: Start accepts. Automaton has 38315 states and 63734 transitions. Word has length 142 [2024-10-12 21:08:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:41,215 INFO L471 AbstractCegarLoop]: Abstraction has 38315 states and 63734 transitions. [2024-10-12 21:08:41,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 38315 states and 63734 transitions. [2024-10-12 21:08:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:41,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:41,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:41,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:08:41,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:41,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:41,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2141084904, now seen corresponding path program 1 times [2024-10-12 21:08:41,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257299676] [2024-10-12 21:08:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:41,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257299676] [2024-10-12 21:08:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257299676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276437001] [2024-10-12 21:08:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:41,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:41,387 INFO L87 Difference]: Start difference. First operand 38315 states and 63734 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:08:48,979 INFO L93 Difference]: Finished difference Result 145020 states and 242573 transitions. [2024-10-12 21:08:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:08:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-12 21:08:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:08:49,309 INFO L225 Difference]: With dead ends: 145020 [2024-10-12 21:08:49,309 INFO L226 Difference]: Without dead ends: 108844 [2024-10-12 21:08:49,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:08:49,405 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5498 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5526 SdHoareTripleChecker+Valid, 21610 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:08:49,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5526 Valid, 21610 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:08:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108844 states. [2024-10-12 21:08:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108844 to 74475. [2024-10-12 21:08:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74475 states, 68192 states have (on average 1.606918700140779) internal successors, (109579), 68451 states have internal predecessors, (109579), 4489 states have call successors, (4489), 1537 states have call predecessors, (4489), 1792 states have return successors, (11560), 4742 states have call predecessors, (11560), 4487 states have call successors, (11560) [2024-10-12 21:08:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74475 states to 74475 states and 125628 transitions. [2024-10-12 21:08:54,270 INFO L78 Accepts]: Start accepts. Automaton has 74475 states and 125628 transitions. Word has length 142 [2024-10-12 21:08:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:08:54,270 INFO L471 AbstractCegarLoop]: Abstraction has 74475 states and 125628 transitions. [2024-10-12 21:08:54,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:08:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 74475 states and 125628 transitions. [2024-10-12 21:08:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 21:08:54,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:08:54,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:08:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:08:54,302 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:08:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:08:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 22531670, now seen corresponding path program 1 times [2024-10-12 21:08:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:08:54,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236603595] [2024-10-12 21:08:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:08:54,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:08:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:08:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 21:08:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:08:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:54,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:08:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 21:08:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:08:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:08:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:08:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236603595] [2024-10-12 21:08:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236603595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:08:54,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:08:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:08:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387117398] [2024-10-12 21:08:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:08:54,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:08:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:08:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:08:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:08:54,455 INFO L87 Difference]: Start difference. First operand 74475 states and 125628 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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)