./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_label40+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e81bb624b13c4231a79ab1bd2052849a1a89cc393bc6bb2c02746b61da23cad6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:52:25,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:52:25,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:52:25,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:52:25,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:52:25,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:52:25,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:52:25,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:52:25,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:52:25,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:52:25,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:52:25,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:52:25,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:52:25,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:52:25,188 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:52:25,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:52:25,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:52:25,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:52:25,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:52:25,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:52:25,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:52:25,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:52:25,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:52:25,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:52:25,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:52:25,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:52:25,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:52:25,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:52:25,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:52:25,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:52:25,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:52:25,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:52:25,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:52:25,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:52:25,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:52:25,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:52:25,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:52:25,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:52:25,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:52:25,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:52:25,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:52:25,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:52:25,201 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 -> e81bb624b13c4231a79ab1bd2052849a1a89cc393bc6bb2c02746b61da23cad6 [2024-10-12 20:52:25,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:52:25,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:52:25,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:52:25,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:52:25,491 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:52:25,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c [2024-10-12 20:52:26,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:52:27,551 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:52:27,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.12.cil-2.c [2024-10-12 20:52:27,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2055e60/ec716b2f2f684fb8ab07606f41a5615a/FLAGbccb06efd [2024-10-12 20:52:28,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2055e60/ec716b2f2f684fb8ab07606f41a5615a [2024-10-12 20:52:28,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:52:28,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:52:28,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:52:28,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:52:28,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:52:28,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:52:28" (1/1) ... [2024-10-12 20:52:28,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6bd984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:28, skipping insertion in model container [2024-10-12 20:52:28,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:52:28" (1/1) ... [2024-10-12 20:52:28,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:52:30,018 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_label40+token_ring.12.cil-2.c[377069,377082] [2024-10-12 20:52:30,047 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_label40+token_ring.12.cil-2.c[383339,383352] [2024-10-12 20:52:30,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:52:30,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:52:31,059 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_label40+token_ring.12.cil-2.c[377069,377082] [2024-10-12 20:52:31,067 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_label40+token_ring.12.cil-2.c[383339,383352] [2024-10-12 20:52:31,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:52:31,162 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:52:31,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31 WrapperNode [2024-10-12 20:52:31,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:52:31,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:52:31,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:52:31,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:52:31,171 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:52:31" (1/1) ... [2024-10-12 20:52:31,251 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:52:31" (1/1) ... [2024-10-12 20:52:31,643 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13233 [2024-10-12 20:52:31,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:52:31,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:52:31,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:52:31,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:52:31,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:31,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:31,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:31,796 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:52:31,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:31,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:32,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:32,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:32,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:32,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:32,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:52:32,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:52:32,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:52:32,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:52:32,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (1/1) ... [2024-10-12 20:52:32,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:52:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:52:32,345 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:52:32,351 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:52:32,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:52:32,445 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:52:32,445 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:52:32,447 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:52:32,448 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:52:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:52:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:52:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:52:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:52:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:52:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:52:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:52:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:52:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:52:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:52:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:52:32,679 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:52:32,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:52:40,412 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2024-10-12 20:52:40,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:52:40,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:52:40,603 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-12 20:52:40,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:52:40 BoogieIcfgContainer [2024-10-12 20:52:40,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:52:40,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:52:40,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:52:40,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:52:40,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:52:28" (1/3) ... [2024-10-12 20:52:40,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2105b83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:52:40, skipping insertion in model container [2024-10-12 20:52:40,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:52:31" (2/3) ... [2024-10-12 20:52:40,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2105b83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:52:40, skipping insertion in model container [2024-10-12 20:52:40,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:52:40" (3/3) ... [2024-10-12 20:52:40,614 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.12.cil-2.c [2024-10-12 20:52:40,631 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:52:40,631 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:52:40,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:52:40,760 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;@58740525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:52:40,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:52:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 2471 states, 2436 states have (on average 1.875615763546798) internal successors, (4569), 2439 states have internal predecessors, (4569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 20:52:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:52:40,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:40,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:40,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1395407095, now seen corresponding path program 1 times [2024-10-12 20:52:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:40,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153872814] [2024-10-12 20:52:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:52:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:52:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:52:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:52:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:41,487 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:52:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153872814] [2024-10-12 20:52:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153872814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:52:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867141425] [2024-10-12 20:52:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:41,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:52:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:52:41,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:52:41,534 INFO L87 Difference]: Start difference. First operand has 2471 states, 2436 states have (on average 1.875615763546798) internal successors, (4569), 2439 states have internal predecessors, (4569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:52:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:43,611 INFO L93 Difference]: Finished difference Result 5068 states and 9466 transitions. [2024-10-12 20:52:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:52:43,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 161 [2024-10-12 20:52:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:43,649 INFO L225 Difference]: With dead ends: 5068 [2024-10-12 20:52:43,649 INFO L226 Difference]: Without dead ends: 2597 [2024-10-12 20:52:43,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:52:43,670 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 979 mSDsluCounter, 12204 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 16461 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:43,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 16461 Invalid, 1126 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:52:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-12 20:52:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2467. [2024-10-12 20:52:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2433 states have (on average 1.8368269625976161) internal successors, (4469), 2435 states have internal predecessors, (4469), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 20:52:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4521 transitions. [2024-10-12 20:52:43,837 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4521 transitions. Word has length 161 [2024-10-12 20:52:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4521 transitions. [2024-10-12 20:52:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:52:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4521 transitions. [2024-10-12 20:52:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:52:43,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:43,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:52:43,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2006676153, now seen corresponding path program 1 times [2024-10-12 20:52:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529352669] [2024-10-12 20:52:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:52:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:52:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:44,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:52:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:52:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:44,133 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:52:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529352669] [2024-10-12 20:52:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529352669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:44,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:44,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:52:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508239924] [2024-10-12 20:52:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:44,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:52:44,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:52:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:52:44,138 INFO L87 Difference]: Start difference. First operand 2467 states and 4521 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:52:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:46,137 INFO L93 Difference]: Finished difference Result 2930 states and 5294 transitions. [2024-10-12 20:52:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:52:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 161 [2024-10-12 20:52:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:46,152 INFO L225 Difference]: With dead ends: 2930 [2024-10-12 20:52:46,152 INFO L226 Difference]: Without dead ends: 2597 [2024-10-12 20:52:46,155 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:52:46,157 INFO L432 NwaCegarLoop]: 4253 mSDtfsCounter, 967 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 16448 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:46,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 16448 Invalid, 1115 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:52:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-10-12 20:52:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2467. [2024-10-12 20:52:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2433 states have (on average 1.8364159473900534) internal successors, (4468), 2435 states have internal predecessors, (4468), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 20:52:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4520 transitions. [2024-10-12 20:52:46,247 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4520 transitions. Word has length 161 [2024-10-12 20:52:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:46,247 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4520 transitions. [2024-10-12 20:52:46,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:52:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4520 transitions. [2024-10-12 20:52:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:52:46,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:46,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:46,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:52:46,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:46,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -965112197, now seen corresponding path program 1 times [2024-10-12 20:52:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379153502] [2024-10-12 20:52:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:46,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:52:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:46,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:52:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:46,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:52:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:52:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:46,724 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:52:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:46,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379153502] [2024-10-12 20:52:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379153502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:52:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212838929] [2024-10-12 20:52:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:46,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:52:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:52:46,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:52:46,733 INFO L87 Difference]: Start difference. First operand 2467 states and 4520 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:52:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:49,851 INFO L93 Difference]: Finished difference Result 3402 states and 6086 transitions. [2024-10-12 20:52:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:52:49,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 161 [2024-10-12 20:52:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:49,869 INFO L225 Difference]: With dead ends: 3402 [2024-10-12 20:52:49,870 INFO L226 Difference]: Without dead ends: 3074 [2024-10-12 20:52:49,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:52:49,874 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5433 mSDsluCounter, 12655 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5452 SdHoareTripleChecker+Valid, 16876 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:49,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5452 Valid, 16876 Invalid, 2405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:52:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2024-10-12 20:52:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2815. [2024-10-12 20:52:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2753 states have (on average 1.8147475481293134) internal successors, (4996), 2756 states have internal predecessors, (4996), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-12 20:52:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 5093 transitions. [2024-10-12 20:52:49,970 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 5093 transitions. Word has length 161 [2024-10-12 20:52:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:49,972 INFO L471 AbstractCegarLoop]: Abstraction has 2815 states and 5093 transitions. [2024-10-12 20:52:49,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:52:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 5093 transitions. [2024-10-12 20:52:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:52:49,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:49,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:49,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:52:49,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:49,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1451895109, now seen corresponding path program 1 times [2024-10-12 20:52:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717763999] [2024-10-12 20:52:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:52:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:52:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:52:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:52:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:52:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:50,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717763999] [2024-10-12 20:52:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717763999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:50,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005225496] [2024-10-12 20:52:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:50,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:50,335 INFO L87 Difference]: Start difference. First operand 2815 states and 5093 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:52:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:54,061 INFO L93 Difference]: Finished difference Result 4247 states and 7492 transitions. [2024-10-12 20:52:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:52:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:52:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:54,079 INFO L225 Difference]: With dead ends: 4247 [2024-10-12 20:52:54,079 INFO L226 Difference]: Without dead ends: 3571 [2024-10-12 20:52:54,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:52:54,086 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5470 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5489 SdHoareTripleChecker+Valid, 21777 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:54,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5489 Valid, 21777 Invalid, 3786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 20:52:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2024-10-12 20:52:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3136. [2024-10-12 20:52:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3046 states have (on average 1.7957977675640184) internal successors, (5470), 3050 states have internal predecessors, (5470), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-12 20:52:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 5611 transitions. [2024-10-12 20:52:54,198 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 5611 transitions. Word has length 161 [2024-10-12 20:52:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:54,199 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 5611 transitions. [2024-10-12 20:52:54,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:52:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 5611 transitions. [2024-10-12 20:52:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:52:54,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:54,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:54,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:52:54,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1055202365, now seen corresponding path program 1 times [2024-10-12 20:52:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749888488] [2024-10-12 20:52:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:52:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:52:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:52:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:52:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:54,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:52:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749888488] [2024-10-12 20:52:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749888488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293583241] [2024-10-12 20:52:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:54,536 INFO L87 Difference]: Start difference. First operand 3136 states and 5611 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:52:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:57,770 INFO L93 Difference]: Finished difference Result 5485 states and 9538 transitions. [2024-10-12 20:52:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:52:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:52:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:57,793 INFO L225 Difference]: With dead ends: 5485 [2024-10-12 20:52:57,793 INFO L226 Difference]: Without dead ends: 4488 [2024-10-12 20:52:57,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:52:57,799 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 5580 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5599 SdHoareTripleChecker+Valid, 21081 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:57,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5599 Valid, 21081 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 20:52:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2024-10-12 20:52:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 3779. [2024-10-12 20:52:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.766859344894027) internal successors, (6419), 3639 states have internal predecessors, (6419), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 20:52:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6652 transitions. [2024-10-12 20:52:57,970 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6652 transitions. Word has length 161 [2024-10-12 20:52:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6652 transitions. [2024-10-12 20:52:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:52:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6652 transitions. [2024-10-12 20:52:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:52:57,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:57,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:57,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:52:57,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:57,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1080680837, now seen corresponding path program 1 times [2024-10-12 20:52:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:57,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496942291] [2024-10-12 20:52:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:57,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:52:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:52:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:52:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:52:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:58,344 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:52:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:58,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496942291] [2024-10-12 20:52:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496942291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:58,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:52:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:52:58,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054876806] [2024-10-12 20:52:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:58,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:52:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:52:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:58,349 INFO L87 Difference]: Start difference. First operand 3779 states and 6652 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:00,053 INFO L93 Difference]: Finished difference Result 6118 states and 10572 transitions. [2024-10-12 20:53:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:53:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:00,073 INFO L225 Difference]: With dead ends: 6118 [2024-10-12 20:53:00,073 INFO L226 Difference]: Without dead ends: 4478 [2024-10-12 20:53:00,080 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:53:00,081 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5192 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5212 SdHoareTripleChecker+Valid, 16690 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:00,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5212 Valid, 16690 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:53:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2024-10-12 20:53:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 3779. [2024-10-12 20:53:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.7654830718414534) internal successors, (6414), 3639 states have internal predecessors, (6414), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 20:53:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6647 transitions. [2024-10-12 20:53:00,231 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6647 transitions. Word has length 161 [2024-10-12 20:53:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6647 transitions. [2024-10-12 20:53:00,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6647 transitions. [2024-10-12 20:53:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:00,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:00,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:53:00,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1011032963, now seen corresponding path program 1 times [2024-10-12 20:53:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:00,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209843883] [2024-10-12 20:53:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:00,663 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:53:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:00,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209843883] [2024-10-12 20:53:00,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209843883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:00,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:00,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351301012] [2024-10-12 20:53:00,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:00,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:00,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:00,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:00,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:00,666 INFO L87 Difference]: Start difference. First operand 3779 states and 6647 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:02,785 INFO L93 Difference]: Finished difference Result 6107 states and 10536 transitions. [2024-10-12 20:53:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:53:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:02,813 INFO L225 Difference]: With dead ends: 6107 [2024-10-12 20:53:02,813 INFO L226 Difference]: Without dead ends: 4467 [2024-10-12 20:53:02,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:53:02,824 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5036 mSDsluCounter, 16601 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:02,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 20809 Invalid, 1945 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:53:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2024-10-12 20:53:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3779. [2024-10-12 20:53:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3633 states have (on average 1.7641067987888797) internal successors, (6409), 3639 states have internal predecessors, (6409), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 20:53:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6642 transitions. [2024-10-12 20:53:03,033 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6642 transitions. Word has length 161 [2024-10-12 20:53:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:03,035 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6642 transitions. [2024-10-12 20:53:03,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6642 transitions. [2024-10-12 20:53:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:03,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:03,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:03,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:53:03,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:03,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 387920639, now seen corresponding path program 1 times [2024-10-12 20:53:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896493644] [2024-10-12 20:53:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:03,348 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:53:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896493644] [2024-10-12 20:53:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896493644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:03,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:03,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:03,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080477076] [2024-10-12 20:53:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:03,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:03,350 INFO L87 Difference]: Start difference. First operand 3779 states and 6642 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:06,889 INFO L93 Difference]: Finished difference Result 7839 states and 13357 transitions. [2024-10-12 20:53:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:53:06,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:06,909 INFO L225 Difference]: With dead ends: 7839 [2024-10-12 20:53:06,909 INFO L226 Difference]: Without dead ends: 6199 [2024-10-12 20:53:06,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:53:06,926 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5453 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3646 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5472 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:06,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5472 Valid, 21775 Invalid, 3709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3646 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 20:53:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2024-10-12 20:53:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 5080. [2024-10-12 20:53:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4822 states have (on average 1.7254251347988387) internal successors, (8320), 4832 states have internal predecessors, (8320), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 20:53:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 8743 transitions. [2024-10-12 20:53:07,173 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 8743 transitions. Word has length 161 [2024-10-12 20:53:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:07,175 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 8743 transitions. [2024-10-12 20:53:07,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 8743 transitions. [2024-10-12 20:53:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:07,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:07,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:53:07,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1229519811, now seen corresponding path program 1 times [2024-10-12 20:53:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091114392] [2024-10-12 20:53:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:07,433 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:53:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091114392] [2024-10-12 20:53:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091114392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273628889] [2024-10-12 20:53:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:07,436 INFO L87 Difference]: Start difference. First operand 5080 states and 8743 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:09,362 INFO L93 Difference]: Finished difference Result 9165 states and 15533 transitions. [2024-10-12 20:53:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:53:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:09,381 INFO L225 Difference]: With dead ends: 9165 [2024-10-12 20:53:09,381 INFO L226 Difference]: Without dead ends: 6224 [2024-10-12 20:53:09,390 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:53:09,391 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5035 mSDsluCounter, 16601 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5055 SdHoareTripleChecker+Valid, 20809 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:09,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5055 Valid, 20809 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:53:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2024-10-12 20:53:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5080. [2024-10-12 20:53:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 4822 states have (on average 1.7235586893405226) internal successors, (8311), 4832 states have internal predecessors, (8311), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 20:53:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 8734 transitions. [2024-10-12 20:53:09,603 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 8734 transitions. Word has length 161 [2024-10-12 20:53:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:09,603 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 8734 transitions. [2024-10-12 20:53:09,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 8734 transitions. [2024-10-12 20:53:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:09,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:09,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:09,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:53:09,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -866053313, now seen corresponding path program 1 times [2024-10-12 20:53:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:09,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215942509] [2024-10-12 20:53:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:09,879 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:53:09,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:09,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215942509] [2024-10-12 20:53:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215942509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:09,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:09,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812033576] [2024-10-12 20:53:09,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:09,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:09,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:09,882 INFO L87 Difference]: Start difference. First operand 5080 states and 8734 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:13,579 INFO L93 Difference]: Finished difference Result 12574 states and 21066 transitions. [2024-10-12 20:53:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:53:13,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:13,613 INFO L225 Difference]: With dead ends: 12574 [2024-10-12 20:53:13,614 INFO L226 Difference]: Without dead ends: 9633 [2024-10-12 20:53:13,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:53:13,628 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5445 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:13,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 21775 Invalid, 3671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:53:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9633 states. [2024-10-12 20:53:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9633 to 7692. [2024-10-12 20:53:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7692 states, 7210 states have (on average 1.6828016643550625) internal successors, (12133), 7228 states have internal predecessors, (12133), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-12 20:53:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7692 states to 7692 states and 12954 transitions. [2024-10-12 20:53:14,024 INFO L78 Accepts]: Start accepts. Automaton has 7692 states and 12954 transitions. Word has length 161 [2024-10-12 20:53:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:14,025 INFO L471 AbstractCegarLoop]: Abstraction has 7692 states and 12954 transitions. [2024-10-12 20:53:14,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7692 states and 12954 transitions. [2024-10-12 20:53:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:14,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:53:14,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:14,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -577233923, now seen corresponding path program 1 times [2024-10-12 20:53:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445932158] [2024-10-12 20:53:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:14,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:53:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445932158] [2024-10-12 20:53:14,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445932158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:14,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:14,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:14,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141679835] [2024-10-12 20:53:14,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:14,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:14,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:14,394 INFO L87 Difference]: Start difference. First operand 7692 states and 12954 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:18,269 INFO L93 Difference]: Finished difference Result 22060 states and 36616 transitions. [2024-10-12 20:53:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:53:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:18,330 INFO L225 Difference]: With dead ends: 22060 [2024-10-12 20:53:18,330 INFO L226 Difference]: Without dead ends: 16507 [2024-10-12 20:53:18,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:53:18,354 INFO L432 NwaCegarLoop]: 4417 mSDtfsCounter, 5444 mSDsluCounter, 17358 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5463 SdHoareTripleChecker+Valid, 21775 SdHoareTripleChecker+Invalid, 3658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:18,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5463 Valid, 21775 Invalid, 3658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:53:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2024-10-12 20:53:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 12929. [2024-10-12 20:53:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12929 states, 11999 states have (on average 1.6497208100675056) internal successors, (19795), 12033 states have internal predecessors, (19795), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-12 20:53:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12929 states to 12929 states and 21466 transitions. [2024-10-12 20:53:19,283 INFO L78 Accepts]: Start accepts. Automaton has 12929 states and 21466 transitions. Word has length 161 [2024-10-12 20:53:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:19,284 INFO L471 AbstractCegarLoop]: Abstraction has 12929 states and 21466 transitions. [2024-10-12 20:53:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 12929 states and 21466 transitions. [2024-10-12 20:53:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:19,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:19,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:53:19,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:19,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1122106497, now seen corresponding path program 1 times [2024-10-12 20:53:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:19,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086945654] [2024-10-12 20:53:19,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:19,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:19,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:19,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:19,563 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:53:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:19,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086945654] [2024-10-12 20:53:19,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086945654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:19,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:19,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588855111] [2024-10-12 20:53:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:19,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:19,566 INFO L87 Difference]: Start difference. First operand 12929 states and 21466 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:23,466 INFO L93 Difference]: Finished difference Result 41031 states and 67906 transitions. [2024-10-12 20:53:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:53:23,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:23,592 INFO L225 Difference]: With dead ends: 41031 [2024-10-12 20:53:23,592 INFO L226 Difference]: Without dead ends: 30241 [2024-10-12 20:53:23,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:53:23,647 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 5541 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 2997 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5560 SdHoareTripleChecker+Valid, 21081 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:23,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5560 Valid, 21081 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2997 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 20:53:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30241 states. [2024-10-12 20:53:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30241 to 23434. [2024-10-12 20:53:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23434 states, 21608 states have (on average 1.6274065161051463) internal successors, (35165), 21674 states have internal predecessors, (35165), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 20:53:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23434 states to 23434 states and 38698 transitions. [2024-10-12 20:53:24,959 INFO L78 Accepts]: Start accepts. Automaton has 23434 states and 38698 transitions. Word has length 161 [2024-10-12 20:53:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:24,959 INFO L471 AbstractCegarLoop]: Abstraction has 23434 states and 38698 transitions. [2024-10-12 20:53:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 23434 states and 38698 transitions. [2024-10-12 20:53:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:24,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:24,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:53:24,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:24,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash -446946371, now seen corresponding path program 1 times [2024-10-12 20:53:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531047577] [2024-10-12 20:53:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:25,199 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:53:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531047577] [2024-10-12 20:53:25,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531047577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:25,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:25,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736375656] [2024-10-12 20:53:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:25,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:25,201 INFO L87 Difference]: Start difference. First operand 23434 states and 38698 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:28,091 INFO L93 Difference]: Finished difference Result 51969 states and 86648 transitions. [2024-10-12 20:53:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:53:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:28,205 INFO L225 Difference]: With dead ends: 51969 [2024-10-12 20:53:28,205 INFO L226 Difference]: Without dead ends: 30674 [2024-10-12 20:53:28,264 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:53:28,266 INFO L432 NwaCegarLoop]: 4208 mSDtfsCounter, 5194 mSDsluCounter, 12482 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5214 SdHoareTripleChecker+Valid, 16690 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:28,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5214 Valid, 16690 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:53:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30674 states. [2024-10-12 20:53:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30674 to 23434. [2024-10-12 20:53:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23434 states, 21608 states have (on average 1.6243983709737135) internal successors, (35100), 21674 states have internal predecessors, (35100), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 20:53:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23434 states to 23434 states and 38633 transitions. [2024-10-12 20:53:29,864 INFO L78 Accepts]: Start accepts. Automaton has 23434 states and 38633 transitions. Word has length 161 [2024-10-12 20:53:29,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:53:29,864 INFO L471 AbstractCegarLoop]: Abstraction has 23434 states and 38633 transitions. [2024-10-12 20:53:29,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23434 states and 38633 transitions. [2024-10-12 20:53:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:53:29,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:53:29,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:53:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:53:29,881 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:53:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:53:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1394998337, now seen corresponding path program 1 times [2024-10-12 20:53:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:53:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392182727] [2024-10-12 20:53:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:53:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:53:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:53:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 20:53:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:53:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 20:53:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 20:53:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:53:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:53:30,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:53:30,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392182727] [2024-10-12 20:53:30,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392182727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:53:30,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:53:30,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:53:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53145708] [2024-10-12 20:53:30,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:53:30,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:53:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:53:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:53:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:53:30,128 INFO L87 Difference]: Start difference. First operand 23434 states and 38633 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:53:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:53:36,703 INFO L93 Difference]: Finished difference Result 88570 states and 146310 transitions. [2024-10-12 20:53:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:53:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-12 20:53:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:53:36,951 INFO L225 Difference]: With dead ends: 88570 [2024-10-12 20:53:36,951 INFO L226 Difference]: Without dead ends: 67275 [2024-10-12 20:53:37,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:53:37,204 INFO L432 NwaCegarLoop]: 4415 mSDtfsCounter, 5871 mSDsluCounter, 17353 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5903 SdHoareTripleChecker+Valid, 21768 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:53:37,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5903 Valid, 21768 Invalid, 3581 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 3515 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 20:53:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67275 states.