./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_label43+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd6b20844e2c749d2220243ee5decb4640d1db1a76545071f1578ab9a21c944c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:57:13,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:57:14,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:57:14,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:57:14,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:57:14,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:57:14,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:57:14,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:57:14,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:57:14,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:57:14,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:57:14,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:57:14,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:57:14,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:57:14,071 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:57:14,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:57:14,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:57:14,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:57:14,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:57:14,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:57:14,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:57:14,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:57:14,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:57:14,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:57:14,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:57:14,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:57:14,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:57:14,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:57:14,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:57:14,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:57:14,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:57:14,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:57:14,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:14,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:57:14,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:57:14,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:57:14,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:57:14,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:57:14,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:57:14,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:57:14,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:57:14,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:57:14,084 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 -> fd6b20844e2c749d2220243ee5decb4640d1db1a76545071f1578ab9a21c944c [2024-10-12 20:57:14,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:57:14,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:57:14,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:57:14,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:57:14,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:57:14,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.09.cil-1.c [2024-10-12 20:57:15,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:57:16,569 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:57:16,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.09.cil-1.c [2024-10-12 20:57:16,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f81cb99f/7ad00d7d1b4e4948afa009e5ff9ee2e0/FLAGc64080b4d [2024-10-12 20:57:16,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f81cb99f/7ad00d7d1b4e4948afa009e5ff9ee2e0 [2024-10-12 20:57:16,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:57:16,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:57:16,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:16,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:57:16,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:57:16,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:16" (1/1) ... [2024-10-12 20:57:16,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109c8960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:16, skipping insertion in model container [2024-10-12 20:57:16,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:16" (1/1) ... [2024-10-12 20:57:16,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:57:18,548 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_label43+token_ring.09.cil-1.c[381679,381692] [2024-10-12 20:57:18,572 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_label43+token_ring.09.cil-1.c[383339,383352] [2024-10-12 20:57:18,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:18,834 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:57:19,713 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_label43+token_ring.09.cil-1.c[381679,381692] [2024-10-12 20:57:19,719 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_label43+token_ring.09.cil-1.c[383339,383352] [2024-10-12 20:57:19,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:19,809 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:57:19,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19 WrapperNode [2024-10-12 20:57:19,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:19,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:19,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:57:19,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:57:19,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:19,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,325 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-10-12 20:57:20,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:20,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:57:20,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:57:20,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:57:20,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,491 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 20:57:20,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:57:20,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:57:20,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:57:20,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:57:20,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (1/1) ... [2024-10-12 20:57:20,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:57:20,995 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 20:57:21,007 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 20:57:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:57:21,090 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:57:21,090 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:57:21,091 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:57:21,092 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:57:21,092 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:57:21,092 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:57:21,093 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:57:21,093 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:57:21,093 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:57:21,093 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:57:21,093 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:57:21,097 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:57:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:57:21,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:57:21,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:57:21,292 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:57:21,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:57:29,457 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-10-12 20:57:29,458 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:57:29,685 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:57:29,686 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-12 20:57:29,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:29 BoogieIcfgContainer [2024-10-12 20:57:29,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:57:29,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:57:29,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:57:29,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:57:29,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:57:16" (1/3) ... [2024-10-12 20:57:29,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c49b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:29, skipping insertion in model container [2024-10-12 20:57:29,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:19" (2/3) ... [2024-10-12 20:57:29,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c49b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:29, skipping insertion in model container [2024-10-12 20:57:29,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:29" (3/3) ... [2024-10-12 20:57:29,696 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.09.cil-1.c [2024-10-12 20:57:29,714 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:57:29,714 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:57:29,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:57:29,863 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;@67775c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:57:29,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:57:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 20:57:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:29,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:29,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:29,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1341158070, now seen corresponding path program 1 times [2024-10-12 20:57:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575606535] [2024-10-12 20:57:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:30,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:30,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:30,576 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 20:57:30,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:30,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575606535] [2024-10-12 20:57:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575606535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:30,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:57:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87259288] [2024-10-12 20:57:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:30,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:57:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:57:30,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:57:30,627 INFO L87 Difference]: Start difference. First operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:32,512 INFO L93 Difference]: Finished difference Result 4898 states and 9162 transitions. [2024-10-12 20:57:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:57:32,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:32,556 INFO L225 Difference]: With dead ends: 4898 [2024-10-12 20:57:32,556 INFO L226 Difference]: Without dead ends: 2498 [2024-10-12 20:57:32,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:57:32,573 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 764 mSDsluCounter, 12138 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 16338 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:32,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 16338 Invalid, 886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:57:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2024-10-12 20:57:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2398. [2024-10-12 20:57:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2367 states have (on average 1.8411491339247994) internal successors, (4358), 2369 states have internal predecessors, (4358), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 20:57:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4404 transitions. [2024-10-12 20:57:32,759 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4404 transitions. Word has length 131 [2024-10-12 20:57:32,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:32,760 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4404 transitions. [2024-10-12 20:57:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4404 transitions. [2024-10-12 20:57:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:32,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:32,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:57:32,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:32,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 709250828, now seen corresponding path program 1 times [2024-10-12 20:57:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370025185] [2024-10-12 20:57:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:32,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:33,258 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 20:57:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:33,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370025185] [2024-10-12 20:57:33,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370025185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:33,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:57:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196122197] [2024-10-12 20:57:33,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:33,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:57:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:57:33,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:57:33,266 INFO L87 Difference]: Start difference. First operand 2398 states and 4404 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:35,730 INFO L93 Difference]: Finished difference Result 3135 states and 5628 transitions. [2024-10-12 20:57:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:57:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:35,749 INFO L225 Difference]: With dead ends: 3135 [2024-10-12 20:57:35,749 INFO L226 Difference]: Without dead ends: 2873 [2024-10-12 20:57:35,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:35,755 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 5107 mSDsluCounter, 12498 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5123 SdHoareTripleChecker+Valid, 16669 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:35,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5123 Valid, 16669 Invalid, 1887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:57:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-12 20:57:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2674. [2024-10-12 20:57:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2618 states have (on average 1.8216195569136746) internal successors, (4769), 2621 states have internal predecessors, (4769), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-10-12 20:57:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 4854 transitions. [2024-10-12 20:57:35,877 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 4854 transitions. Word has length 131 [2024-10-12 20:57:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:35,878 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 4854 transitions. [2024-10-12 20:57:35,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 4854 transitions. [2024-10-12 20:57:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:35,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:35,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:35,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:57:35,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1199039984, now seen corresponding path program 1 times [2024-10-12 20:57:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119233027] [2024-10-12 20:57:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:36,299 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 20:57:36,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119233027] [2024-10-12 20:57:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119233027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:36,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705847930] [2024-10-12 20:57:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:36,304 INFO L87 Difference]: Start difference. First operand 2674 states and 4854 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:39,431 INFO L93 Difference]: Finished difference Result 3800 states and 6722 transitions. [2024-10-12 20:57:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:39,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:39,447 INFO L225 Difference]: With dead ends: 3800 [2024-10-12 20:57:39,447 INFO L226 Difference]: Without dead ends: 3262 [2024-10-12 20:57:39,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:39,451 INFO L432 NwaCegarLoop]: 4330 mSDtfsCounter, 5140 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 21376 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:39,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 21376 Invalid, 2965 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:57:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-12 20:57:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2929. [2024-10-12 20:57:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8040730337078652) internal successors, (5138), 2852 states have internal predecessors, (5138), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 20:57:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5261 transitions. [2024-10-12 20:57:39,556 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5261 transitions. Word has length 131 [2024-10-12 20:57:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:39,556 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5261 transitions. [2024-10-12 20:57:39,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5261 transitions. [2024-10-12 20:57:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:39,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:39,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:39,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:57:39,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash -727683634, now seen corresponding path program 1 times [2024-10-12 20:57:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358501000] [2024-10-12 20:57:39,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:39,865 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 20:57:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358501000] [2024-10-12 20:57:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358501000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:39,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936430519] [2024-10-12 20:57:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:39,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:39,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:39,868 INFO L87 Difference]: Start difference. First operand 2929 states and 5261 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:41,348 INFO L93 Difference]: Finished difference Result 4067 states and 7159 transitions. [2024-10-12 20:57:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:41,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:41,364 INFO L225 Difference]: With dead ends: 4067 [2024-10-12 20:57:41,365 INFO L226 Difference]: Without dead ends: 3274 [2024-10-12 20:57:41,369 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 20:57:41,370 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4804 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4821 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:41,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4821 Valid, 20600 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:57:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-10-12 20:57:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2929. [2024-10-12 20:57:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8030196629213484) internal successors, (5135), 2852 states have internal predecessors, (5135), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 20:57:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5258 transitions. [2024-10-12 20:57:41,472 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5258 transitions. Word has length 131 [2024-10-12 20:57:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:41,473 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5258 transitions. [2024-10-12 20:57:41,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5258 transitions. [2024-10-12 20:57:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:41,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:41,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:57:41,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:41,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1435932940, now seen corresponding path program 1 times [2024-10-12 20:57:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:41,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197340086] [2024-10-12 20:57:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:41,745 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 20:57:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:41,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197340086] [2024-10-12 20:57:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197340086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86225968] [2024-10-12 20:57:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:41,748 INFO L87 Difference]: Start difference. First operand 2929 states and 5258 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:43,422 INFO L93 Difference]: Finished difference Result 4063 states and 7142 transitions. [2024-10-12 20:57:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:43,439 INFO L225 Difference]: With dead ends: 4063 [2024-10-12 20:57:43,440 INFO L226 Difference]: Without dead ends: 3270 [2024-10-12 20:57:43,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:57:43,448 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4802 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:43,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 20600 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:57:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-12 20:57:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2929. [2024-10-12 20:57:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8019662921348314) internal successors, (5132), 2852 states have internal predecessors, (5132), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 20:57:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5255 transitions. [2024-10-12 20:57:43,587 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5255 transitions. Word has length 131 [2024-10-12 20:57:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:43,587 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5255 transitions. [2024-10-12 20:57:43,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:43,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5255 transitions. [2024-10-12 20:57:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:43,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:43,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:43,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:57:43,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:43,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 397348366, now seen corresponding path program 1 times [2024-10-12 20:57:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:43,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327622158] [2024-10-12 20:57:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,877 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 20:57:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327622158] [2024-10-12 20:57:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327622158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:43,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:43,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634731555] [2024-10-12 20:57:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:43,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:43,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:43,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:43,882 INFO L87 Difference]: Start difference. First operand 2929 states and 5255 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:45,122 INFO L93 Difference]: Finished difference Result 4059 states and 7125 transitions. [2024-10-12 20:57:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:45,136 INFO L225 Difference]: With dead ends: 4059 [2024-10-12 20:57:45,136 INFO L226 Difference]: Without dead ends: 3266 [2024-10-12 20:57:45,141 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 20:57:45,141 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4919 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:45,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 16513 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:57:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2024-10-12 20:57:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2929. [2024-10-12 20:57:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8009129213483146) internal successors, (5129), 2852 states have internal predecessors, (5129), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-12 20:57:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5252 transitions. [2024-10-12 20:57:45,275 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5252 transitions. Word has length 131 [2024-10-12 20:57:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5252 transitions. [2024-10-12 20:57:45,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5252 transitions. [2024-10-12 20:57:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:45,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:45,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:45,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:57:45,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:45,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1575817012, now seen corresponding path program 1 times [2024-10-12 20:57:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084682033] [2024-10-12 20:57:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,559 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 20:57:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084682033] [2024-10-12 20:57:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084682033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:45,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641408100] [2024-10-12 20:57:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:45,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:45,566 INFO L87 Difference]: Start difference. First operand 2929 states and 5252 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:47,993 INFO L93 Difference]: Finished difference Result 4761 states and 8249 transitions. [2024-10-12 20:57:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:48,013 INFO L225 Difference]: With dead ends: 4761 [2024-10-12 20:57:48,013 INFO L226 Difference]: Without dead ends: 3968 [2024-10-12 20:57:48,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:48,021 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 5191 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5207 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:48,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5207 Valid, 20827 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:57:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2024-10-12 20:57:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3452. [2024-10-12 20:57:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7705510388437218) internal successors, (5880), 3327 states have internal predecessors, (5880), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-12 20:57:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6083 transitions. [2024-10-12 20:57:48,165 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6083 transitions. Word has length 131 [2024-10-12 20:57:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6083 transitions. [2024-10-12 20:57:48,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6083 transitions. [2024-10-12 20:57:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:48,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:48,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:48,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:57:48,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:48,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 577289806, now seen corresponding path program 1 times [2024-10-12 20:57:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830172888] [2024-10-12 20:57:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,394 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 20:57:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830172888] [2024-10-12 20:57:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830172888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896667265] [2024-10-12 20:57:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:48,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:48,397 INFO L87 Difference]: Start difference. First operand 3452 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:49,855 INFO L93 Difference]: Finished difference Result 5271 states and 9068 transitions. [2024-10-12 20:57:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:49,872 INFO L225 Difference]: With dead ends: 5271 [2024-10-12 20:57:49,872 INFO L226 Difference]: Without dead ends: 3955 [2024-10-12 20:57:49,878 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 20:57:49,879 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4918 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:49,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 16513 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:57:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2024-10-12 20:57:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3452. [2024-10-12 20:57:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7690454682324601) internal successors, (5875), 3327 states have internal predecessors, (5875), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-12 20:57:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6078 transitions. [2024-10-12 20:57:50,021 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6078 transitions. Word has length 131 [2024-10-12 20:57:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6078 transitions. [2024-10-12 20:57:50,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6078 transitions. [2024-10-12 20:57:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:50,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:50,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:50,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:57:50,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:50,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -45991796, now seen corresponding path program 1 times [2024-10-12 20:57:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35009414] [2024-10-12 20:57:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:50,264 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 20:57:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:50,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35009414] [2024-10-12 20:57:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35009414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:50,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157302543] [2024-10-12 20:57:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:50,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:50,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:50,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:50,267 INFO L87 Difference]: Start difference. First operand 3452 states and 6078 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:53,012 INFO L93 Difference]: Finished difference Result 6630 states and 11232 transitions. [2024-10-12 20:57:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:53,032 INFO L225 Difference]: With dead ends: 6630 [2024-10-12 20:57:53,032 INFO L226 Difference]: Without dead ends: 5314 [2024-10-12 20:57:53,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:53,040 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5105 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:53,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 21374 Invalid, 2833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:57:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2024-10-12 20:57:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4498. [2024-10-12 20:57:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 4267 states have (on average 1.7265057417389267) internal successors, (7367), 4277 states have internal predecessors, (7367), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-12 20:57:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 7736 transitions. [2024-10-12 20:57:53,240 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 7736 transitions. Word has length 131 [2024-10-12 20:57:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 7736 transitions. [2024-10-12 20:57:53,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 7736 transitions. [2024-10-12 20:57:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:53,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:53,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:53,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:57:53,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 72449678, now seen corresponding path program 1 times [2024-10-12 20:57:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349916965] [2024-10-12 20:57:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:53,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:53,467 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 20:57:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349916965] [2024-10-12 20:57:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349916965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:53,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731482916] [2024-10-12 20:57:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:53,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:53,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:53,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:53,470 INFO L87 Difference]: Start difference. First operand 4498 states and 7736 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:56,242 INFO L93 Difference]: Finished difference Result 10374 states and 17252 transitions. [2024-10-12 20:57:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:57:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:56,272 INFO L225 Difference]: With dead ends: 10374 [2024-10-12 20:57:56,272 INFO L226 Difference]: Without dead ends: 8012 [2024-10-12 20:57:56,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:56,284 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5110 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5126 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:56,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5126 Valid, 21374 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:57:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2024-10-12 20:57:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 6595. [2024-10-12 20:57:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6164 states have (on average 1.6802401038286827) internal successors, (10357), 6182 states have internal predecessors, (10357), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-10-12 20:57:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 11076 transitions. [2024-10-12 20:57:56,633 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 11076 transitions. Word has length 131 [2024-10-12 20:57:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:56,633 INFO L471 AbstractCegarLoop]: Abstraction has 6595 states and 11076 transitions. [2024-10-12 20:57:56,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 11076 transitions. [2024-10-12 20:57:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:57:56,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:56,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:57:56,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:57:56,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1461743692, now seen corresponding path program 1 times [2024-10-12 20:57:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:56,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218392339] [2024-10-12 20:57:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:56,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:57:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:57:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:57:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:57:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,853 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 20:57:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218392339] [2024-10-12 20:57:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218392339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801791060] [2024-10-12 20:57:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:56,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:56,855 INFO L87 Difference]: Start difference. First operand 6595 states and 11076 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:00,337 INFO L93 Difference]: Finished difference Result 19523 states and 32052 transitions. [2024-10-12 20:58:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:00,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:58:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:00,389 INFO L225 Difference]: With dead ends: 19523 [2024-10-12 20:58:00,389 INFO L226 Difference]: Without dead ends: 15064 [2024-10-12 20:58:00,407 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 20:58:00,408 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 5178 mSDsluCounter, 17038 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5193 SdHoareTripleChecker+Valid, 21363 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:00,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5193 Valid, 21363 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3229 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 20:58:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15064 states. [2024-10-12 20:58:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15064 to 10709. [2024-10-12 20:58:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10709 states, 9894 states have (on average 1.6423084697796644) internal successors, (16249), 9928 states have internal predecessors, (16249), 583 states have call successors, (583), 198 states have call predecessors, (583), 230 states have return successors, (858), 614 states have call predecessors, (858), 583 states have call successors, (858) [2024-10-12 20:58:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17690 transitions. [2024-10-12 20:58:01,027 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17690 transitions. Word has length 131 [2024-10-12 20:58:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:01,027 INFO L471 AbstractCegarLoop]: Abstraction has 10709 states and 17690 transitions. [2024-10-12 20:58:01,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17690 transitions. [2024-10-12 20:58:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:58:01,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:01,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:01,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:58:01,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:01,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash -404964982, now seen corresponding path program 1 times [2024-10-12 20:58:01,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:01,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622245134] [2024-10-12 20:58:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:01,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:58:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:58:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:58:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:58:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:01,236 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 20:58:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622245134] [2024-10-12 20:58:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622245134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:01,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:01,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54373083] [2024-10-12 20:58:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:01,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:01,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:01,239 INFO L87 Difference]: Start difference. First operand 10709 states and 17690 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:04,794 INFO L93 Difference]: Finished difference Result 35491 states and 58044 transitions. [2024-10-12 20:58:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:58:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:04,908 INFO L225 Difference]: With dead ends: 35491 [2024-10-12 20:58:04,909 INFO L226 Difference]: Without dead ends: 26918 [2024-10-12 20:58:04,957 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 20:58:04,958 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5363 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5389 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:04,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5389 Valid, 21367 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:58:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26918 states. [2024-10-12 20:58:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26918 to 19014. [2024-10-12 20:58:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19014 states, 17447 states have (on average 1.6155786095030664) internal successors, (28187), 17513 states have internal predecessors, (28187), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 454 states have return successors, (1904), 1174 states have call predecessors, (1904), 1111 states have call successors, (1904) [2024-10-12 20:58:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 31202 transitions. [2024-10-12 20:58:06,318 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 31202 transitions. Word has length 131 [2024-10-12 20:58:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:06,319 INFO L471 AbstractCegarLoop]: Abstraction has 19014 states and 31202 transitions. [2024-10-12 20:58:06,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 31202 transitions. [2024-10-12 20:58:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:58:06,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:06,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:06,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:58:06,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:06,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1712107380, now seen corresponding path program 1 times [2024-10-12 20:58:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853578273] [2024-10-12 20:58:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:58:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:58:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:58:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:58:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:06,530 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 20:58:06,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:06,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853578273] [2024-10-12 20:58:06,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853578273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:06,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:06,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112886382] [2024-10-12 20:58:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:06,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:06,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:06,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:06,533 INFO L87 Difference]: Start difference. First operand 19014 states and 31202 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:11,329 INFO L93 Difference]: Finished difference Result 67154 states and 110194 transitions. [2024-10-12 20:58:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:58:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:11,530 INFO L225 Difference]: With dead ends: 67154 [2024-10-12 20:58:11,530 INFO L226 Difference]: Without dead ends: 50276 [2024-10-12 20:58:11,588 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 20:58:11,589 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5327 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5353 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:11,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5353 Valid, 21367 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:58:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50276 states. [2024-10-12 20:58:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50276 to 35623. [2024-10-12 20:58:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35623 states, 32584 states have (on average 1.599711514853916) internal successors, (52125), 32714 states have internal predecessors, (52125), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 902 states have return successors, (4450), 2262 states have call predecessors, (4450), 2135 states have call successors, (4450) [2024-10-12 20:58:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35623 states to 35623 states and 58710 transitions. [2024-10-12 20:58:14,350 INFO L78 Accepts]: Start accepts. Automaton has 35623 states and 58710 transitions. Word has length 131 [2024-10-12 20:58:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 35623 states and 58710 transitions. [2024-10-12 20:58:14,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 35623 states and 58710 transitions. [2024-10-12 20:58:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:58:14,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:14,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:58:14,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:58:14,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:14,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash 185389386, now seen corresponding path program 1 times [2024-10-12 20:58:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:14,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774984991] [2024-10-12 20:58:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:14,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 20:58:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 20:58:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 20:58:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:58:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:14,565 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 20:58:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774984991] [2024-10-12 20:58:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774984991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132763078] [2024-10-12 20:58:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:14,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:14,568 INFO L87 Difference]: Start difference. First operand 35623 states and 58710 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:22,580 INFO L93 Difference]: Finished difference Result 129521 states and 214776 transitions. [2024-10-12 20:58:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2024-10-12 20:58:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:23,120 INFO L225 Difference]: With dead ends: 129521 [2024-10-12 20:58:23,120 INFO L226 Difference]: Without dead ends: 96034 [2024-10-12 20:58:23,395 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 20:58:23,396 INFO L432 NwaCegarLoop]: 4182 mSDtfsCounter, 5211 mSDsluCounter, 16645 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5226 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:23,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5226 Valid, 20827 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:58:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96034 states.