./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:08:28,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:08:28,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:08:28,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:08:28,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:08:28,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:08:28,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:08:28,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:08:28,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:08:28,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:08:28,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:08:28,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:08:28,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:08:28,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:08:28,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:08:28,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:08:28,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:08:28,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:08:28,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:08:28,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:08:28,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:08:28,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:08:28,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:08:28,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:08:28,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:08:28,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:08:28,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:08:28,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:08:28,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:08:28,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:08:28,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:08:28,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:08:28,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:08:28,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:08:28,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:08:28,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:08:28,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:08:28,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:08:28,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:08:28,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:08:28,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:08:28,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:08:28,614 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 -> 257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667 [2024-11-11 22:08:28,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:08:28,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:08:28,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:08:28,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:08:28,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:08:28,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c [2024-11-11 22:08:30,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:08:30,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:08:30,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c [2024-11-11 22:08:31,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a418466f4/50358d9d9a3248139710e871fe134611/FLAGfdb02f5b9 [2024-11-11 22:08:31,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a418466f4/50358d9d9a3248139710e871fe134611 [2024-11-11 22:08:31,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:08:31,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:08:31,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:08:31,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:08:31,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:08:31,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:08:31" (1/1) ... [2024-11-11 22:08:31,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9c4c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:31, skipping insertion in model container [2024-11-11 22:08:31,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:08:31" (1/1) ... [2024-11-11 22:08:31,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:08:32,992 WARN L250 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_label42+token_ring.11.cil-1.c[378560,378573] [2024-11-11 22:08:33,027 WARN L250 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_label42+token_ring.11.cil-1.c[383339,383352] [2024-11-11 22:08:33,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:08:33,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:08:34,115 WARN L250 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_label42+token_ring.11.cil-1.c[378560,378573] [2024-11-11 22:08:34,123 WARN L250 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_label42+token_ring.11.cil-1.c[383339,383352] [2024-11-11 22:08:34,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:08:34,247 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:08:34,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34 WrapperNode [2024-11-11 22:08:34,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:08:34,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:08:34,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:08:34,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:08:34,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:34,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:34,731 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13179 [2024-11-11 22:08:34,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:08:34,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:08:34,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:08:34,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:08:34,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:34,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:34,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,019 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-11-11 22:08:35,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:08:35,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:08:35,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:08:35,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:08:35,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (1/1) ... [2024-11-11 22:08:35,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:08:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:08:35,607 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-11-11 22:08:35,609 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-11-11 22:08:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:08:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:08:35,646 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:08:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:08:35,646 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:08:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:08:35,647 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:08:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:08:35,647 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:08:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:08:35,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:08:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:08:35,647 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:08:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:08:35,648 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:08:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:08:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:08:35,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:08:35,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:08:35,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:08:43,231 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2024-11-11 22:08:43,231 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:08:43,296 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:08:43,296 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-11 22:08:43,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:08:43 BoogieIcfgContainer [2024-11-11 22:08:43,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:08:43,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:08:43,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:08:43,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:08:43,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:08:31" (1/3) ... [2024-11-11 22:08:43,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d41c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:08:43, skipping insertion in model container [2024-11-11 22:08:43,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:08:34" (2/3) ... [2024-11-11 22:08:43,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d41c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:08:43, skipping insertion in model container [2024-11-11 22:08:43,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:08:43" (3/3) ... [2024-11-11 22:08:43,306 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-1.c [2024-11-11 22:08:43,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:08:43,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:08:43,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:08:43,450 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;@538d4aa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:08:43,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:08:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 2560 states, 2523 states have (on average 1.840665873959572) internal successors, (4644), 2528 states have internal predecessors, (4644), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 22:08:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:08:43,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:43,478 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:43,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:43,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1643265123, now seen corresponding path program 1 times [2024-11-11 22:08:43,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:43,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794999648] [2024-11-11 22:08:43,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:08:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:08:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:08:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:08:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794999648] [2024-11-11 22:08:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794999648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:44,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:44,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:08:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576005206] [2024-11-11 22:08:44,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:44,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:08:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:44,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:08:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:08:44,246 INFO L87 Difference]: Start difference. First operand has 2560 states, 2523 states have (on average 1.840665873959572) internal successors, (4644), 2528 states have internal predecessors, (4644), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:46,356 INFO L93 Difference]: Finished difference Result 5238 states and 9599 transitions. [2024-11-11 22:08:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:08:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:08:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:46,396 INFO L225 Difference]: With dead ends: 5238 [2024-11-11 22:08:46,396 INFO L226 Difference]: Without dead ends: 2623 [2024-11-11 22:08:46,409 INFO L434 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-11-11 22:08:46,414 INFO L435 NwaCegarLoop]: 4371 mSDtfsCounter, 983 mSDsluCounter, 12481 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 16852 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:46,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 16852 Invalid, 1018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:08:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-11 22:08:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2492. [2024-11-11 22:08:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2457 states have (on average 1.8245828245828246) internal successors, (4483), 2460 states have internal predecessors, (4483), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-11 22:08:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4535 transitions. [2024-11-11 22:08:46,600 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4535 transitions. Word has length 168 [2024-11-11 22:08:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 4535 transitions. [2024-11-11 22:08:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4535 transitions. [2024-11-11 22:08:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:08:46,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:46,608 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:46,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:08:46,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -238073445, now seen corresponding path program 1 times [2024-11-11 22:08:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133553595] [2024-11-11 22:08:46,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:08:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:08:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:08:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:08:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133553595] [2024-11-11 22:08:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133553595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:08:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125836925] [2024-11-11 22:08:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:08:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:47,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:08:47,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:08:47,021 INFO L87 Difference]: Start difference. First operand 2492 states and 4535 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:50,114 INFO L93 Difference]: Finished difference Result 3474 states and 6110 transitions. [2024-11-11 22:08:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:08:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:08:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:50,131 INFO L225 Difference]: With dead ends: 3474 [2024-11-11 22:08:50,132 INFO L226 Difference]: Without dead ends: 3122 [2024-11-11 22:08:50,134 INFO L434 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-11-11 22:08:50,136 INFO L435 NwaCegarLoop]: 4274 mSDtfsCounter, 5431 mSDsluCounter, 12841 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5449 SdHoareTripleChecker+Valid, 17115 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:50,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5449 Valid, 17115 Invalid, 2214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:08:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-11-11 22:08:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2859. [2024-11-11 22:08:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2797 states have (on average 1.794780121558813) internal successors, (5020), 2801 states have internal predecessors, (5020), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-11-11 22:08:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 5115 transitions. [2024-11-11 22:08:50,235 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 5115 transitions. Word has length 168 [2024-11-11 22:08:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:50,237 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 5115 transitions. [2024-11-11 22:08:50,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 5115 transitions. [2024-11-11 22:08:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:08:50,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:50,242 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:50,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:08:50,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:50,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 684327063, now seen corresponding path program 1 times [2024-11-11 22:08:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914373387] [2024-11-11 22:08:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:08:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:08:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:08:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:08:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914373387] [2024-11-11 22:08:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914373387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:50,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375311816] [2024-11-11 22:08:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:50,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:50,625 INFO L87 Difference]: Start difference. First operand 2859 states and 5115 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:54,385 INFO L93 Difference]: Finished difference Result 4356 states and 7519 transitions. [2024-11-11 22:08:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:08:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:54,403 INFO L225 Difference]: With dead ends: 4356 [2024-11-11 22:08:54,404 INFO L226 Difference]: Without dead ends: 3637 [2024-11-11 22:08:54,409 INFO L434 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-11-11 22:08:54,410 INFO L435 NwaCegarLoop]: 4519 mSDtfsCounter, 5458 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5476 SdHoareTripleChecker+Valid, 22286 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:54,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5476 Valid, 22286 Invalid, 3405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:08:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2024-11-11 22:08:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3201. [2024-11-11 22:08:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3112 states have (on average 1.7696015424164524) internal successors, (5507), 3117 states have internal predecessors, (5507), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-11 22:08:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 5644 transitions. [2024-11-11 22:08:54,555 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 5644 transitions. Word has length 168 [2024-11-11 22:08:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:54,556 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 5644 transitions. [2024-11-11 22:08:54,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 5644 transitions. [2024-11-11 22:08:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:08:54,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:54,559 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:54,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:08:54,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:54,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1713660775, now seen corresponding path program 1 times [2024-11-11 22:08:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582386904] [2024-11-11 22:08:54,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:54,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:08:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:54,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:08:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:08:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:54,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:08:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582386904] [2024-11-11 22:08:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582386904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357971481] [2024-11-11 22:08:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:54,860 INFO L87 Difference]: Start difference. First operand 3201 states and 5644 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:08:58,603 INFO L93 Difference]: Finished difference Result 5657 states and 9580 transitions. [2024-11-11 22:08:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:08:58,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:08:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:08:58,627 INFO L225 Difference]: With dead ends: 5657 [2024-11-11 22:08:58,628 INFO L226 Difference]: Without dead ends: 4596 [2024-11-11 22:08:58,634 INFO L434 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-11-11 22:08:58,635 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 5456 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:08:58,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 22284 Invalid, 3403 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:08:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2024-11-11 22:08:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 3886. [2024-11-11 22:08:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3743 states have (on average 1.7317659631311781) internal successors, (6482), 3750 states have internal predecessors, (6482), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-11 22:08:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 6707 transitions. [2024-11-11 22:08:58,804 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 6707 transitions. Word has length 168 [2024-11-11 22:08:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:08:58,804 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 6707 transitions. [2024-11-11 22:08:58,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:08:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 6707 transitions. [2024-11-11 22:08:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:08:58,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:08:58,807 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:08:58,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:08:58,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:08:58,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:08:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1375373225, now seen corresponding path program 1 times [2024-11-11 22:08:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:08:58,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079790254] [2024-11-11 22:08:58,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:08:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:08:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:58,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:08:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:08:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:08:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:08:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:08:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:08:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:08:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:08:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079790254] [2024-11-11 22:08:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079790254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:08:59,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:08:59,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:08:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514393302] [2024-11-11 22:08:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:08:59,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:08:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:08:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:08:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:08:59,089 INFO L87 Difference]: Start difference. First operand 3886 states and 6707 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:03,271 INFO L93 Difference]: Finished difference Result 8162 states and 13523 transitions. [2024-11-11 22:09:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:03,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:03,306 INFO L225 Difference]: With dead ends: 8162 [2024-11-11 22:09:03,307 INFO L226 Difference]: Without dead ends: 6416 [2024-11-11 22:09:03,315 INFO L434 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-11-11 22:09:03,317 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 5452 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5470 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:03,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5470 Valid, 22284 Invalid, 3394 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 22:09:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6416 states. [2024-11-11 22:09:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6416 to 5257. [2024-11-11 22:09:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5006 states have (on average 1.6843787455053936) internal successors, (8432), 5017 states have internal predecessors, (8432), 187 states have call successors, (187), 55 states have call predecessors, (187), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-11 22:09:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8839 transitions. [2024-11-11 22:09:03,647 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8839 transitions. Word has length 168 [2024-11-11 22:09:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:03,647 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 8839 transitions. [2024-11-11 22:09:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8839 transitions. [2024-11-11 22:09:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:09:03,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:03,659 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:03,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:09:03,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:03,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -948818727, now seen corresponding path program 1 times [2024-11-11 22:09:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595909669] [2024-11-11 22:09:03,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:09:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:09:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:09:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595909669] [2024-11-11 22:09:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595909669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220151] [2024-11-11 22:09:04,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:04,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:04,033 INFO L87 Difference]: Start difference. First operand 5257 states and 8839 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:07,893 INFO L93 Difference]: Finished difference Result 13171 states and 21425 transitions. [2024-11-11 22:09:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:07,958 INFO L225 Difference]: With dead ends: 13171 [2024-11-11 22:09:07,959 INFO L226 Difference]: Without dead ends: 10054 [2024-11-11 22:09:07,972 INFO L434 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-11-11 22:09:07,973 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 5448 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5466 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:07,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5466 Valid, 22284 Invalid, 3385 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:09:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10054 states. [2024-11-11 22:09:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10054 to 8004. [2024-11-11 22:09:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8004 states, 7537 states have (on average 1.6369908451638584) internal successors, (12338), 7556 states have internal predecessors, (12338), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-11 22:09:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8004 states to 8004 states and 13127 transitions. [2024-11-11 22:09:08,366 INFO L78 Accepts]: Start accepts. Automaton has 8004 states and 13127 transitions. Word has length 168 [2024-11-11 22:09:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:08,366 INFO L471 AbstractCegarLoop]: Abstraction has 8004 states and 13127 transitions. [2024-11-11 22:09:08,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8004 states and 13127 transitions. [2024-11-11 22:09:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:09:08,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:08,372 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:09:08,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:08,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1489248233, now seen corresponding path program 1 times [2024-11-11 22:09:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986903814] [2024-11-11 22:09:08,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:09:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:09:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:09:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:08,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:08,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986903814] [2024-11-11 22:09:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986903814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:08,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803624293] [2024-11-11 22:09:08,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:08,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:08,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:08,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:08,743 INFO L87 Difference]: Start difference. First operand 8004 states and 13127 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:12,552 INFO L93 Difference]: Finished difference Result 23188 states and 37287 transitions. [2024-11-11 22:09:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:12,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:12,610 INFO L225 Difference]: With dead ends: 23188 [2024-11-11 22:09:12,611 INFO L226 Difference]: Without dead ends: 17324 [2024-11-11 22:09:12,639 INFO L434 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-11-11 22:09:12,640 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 5450 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5468 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:12,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5468 Valid, 22284 Invalid, 3371 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:09:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17324 states. [2024-11-11 22:09:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17324 to 13511. [2024-11-11 22:09:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 12612 states have (on average 1.5991119568664764) internal successors, (20168), 12647 states have internal predecessors, (20168), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-11 22:09:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 21775 transitions. [2024-11-11 22:09:13,762 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 21775 transitions. Word has length 168 [2024-11-11 22:09:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:13,763 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 21775 transitions. [2024-11-11 22:09:13,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 21775 transitions. [2024-11-11 22:09:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:09:13,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:13,772 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:13,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:09:13,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:13,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1645228775, now seen corresponding path program 1 times [2024-11-11 22:09:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:13,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424223594] [2024-11-11 22:09:13,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:09:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:09:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:09:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424223594] [2024-11-11 22:09:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424223594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552117380] [2024-11-11 22:09:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:14,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:14,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:14,077 INFO L87 Difference]: Start difference. First operand 13511 states and 21775 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:16,445 INFO L93 Difference]: Finished difference Result 28900 states and 46552 transitions. [2024-11-11 22:09:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:09:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:16,508 INFO L225 Difference]: With dead ends: 28900 [2024-11-11 22:09:16,509 INFO L226 Difference]: Without dead ends: 17529 [2024-11-11 22:09:16,545 INFO L434 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-11-11 22:09:16,547 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 5043 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 21042 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:16,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 21042 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:09:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2024-11-11 22:09:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 13511. [2024-11-11 22:09:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 12612 states have (on average 1.5964954012052015) internal successors, (20135), 12647 states have internal predecessors, (20135), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-11 22:09:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 21742 transitions. [2024-11-11 22:09:17,464 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 21742 transitions. Word has length 168 [2024-11-11 22:09:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:17,464 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 21742 transitions. [2024-11-11 22:09:17,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 21742 transitions. [2024-11-11 22:09:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:09:17,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:17,474 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:17,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:09:17,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:17,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 861868699, now seen corresponding path program 1 times [2024-11-11 22:09:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376105736] [2024-11-11 22:09:17,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:09:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:09:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:17,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:09:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:17,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376105736] [2024-11-11 22:09:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376105736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:17,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:17,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542784128] [2024-11-11 22:09:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:17,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:17,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:17,748 INFO L87 Difference]: Start difference. First operand 13511 states and 21742 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:21,862 INFO L93 Difference]: Finished difference Result 43156 states and 68909 transitions. [2024-11-11 22:09:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:21,987 INFO L225 Difference]: With dead ends: 43156 [2024-11-11 22:09:21,988 INFO L226 Difference]: Without dead ends: 31785 [2024-11-11 22:09:22,036 INFO L434 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-11-11 22:09:22,037 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 5439 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5457 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:22,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5457 Valid, 22284 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 22:09:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31785 states. [2024-11-11 22:09:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31785 to 24620. [2024-11-11 22:09:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24620 states, 22857 states have (on average 1.570853567834799) internal successors, (35905), 22924 states have internal predecessors, (35905), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 454 states have return successors, (2098), 1368 states have call predecessors, (2098), 1305 states have call successors, (2098) [2024-11-11 22:09:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24620 states to 24620 states and 39310 transitions. [2024-11-11 22:09:23,810 INFO L78 Accepts]: Start accepts. Automaton has 24620 states and 39310 transitions. Word has length 168 [2024-11-11 22:09:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:23,811 INFO L471 AbstractCegarLoop]: Abstraction has 24620 states and 39310 transitions. [2024-11-11 22:09:23,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24620 states and 39310 transitions. [2024-11-11 22:09:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:09:23,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:23,845 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:23,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:09:23,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:23,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1274014503, now seen corresponding path program 1 times [2024-11-11 22:09:23,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018351114] [2024-11-11 22:09:23,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:09:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:09:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:09:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:24,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018351114] [2024-11-11 22:09:24,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018351114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:24,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:24,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:24,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864926519] [2024-11-11 22:09:24,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:24,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:24,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:24,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:24,258 INFO L87 Difference]: Start difference. First operand 24620 states and 39310 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:30,937 INFO L93 Difference]: Finished difference Result 83227 states and 133155 transitions. [2024-11-11 22:09:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:30,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:31,279 INFO L225 Difference]: With dead ends: 83227 [2024-11-11 22:09:31,279 INFO L226 Difference]: Without dead ends: 60747 [2024-11-11 22:09:31,337 INFO L434 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-11-11 22:09:31,338 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 5438 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5456 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:09:31,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5456 Valid, 22284 Invalid, 3305 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:09:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60747 states. [2024-11-11 22:09:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60747 to 46897. [2024-11-11 22:09:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46897 states, 43406 states have (on average 1.555798737501728) internal successors, (67531), 43537 states have internal predecessors, (67531), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 902 states have return successors, (4900), 2712 states have call predecessors, (4900), 2585 states have call successors, (4900) [2024-11-11 22:09:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46897 states to 46897 states and 75018 transitions. [2024-11-11 22:09:34,167 INFO L78 Accepts]: Start accepts. Automaton has 46897 states and 75018 transitions. Word has length 168 [2024-11-11 22:09:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:09:34,168 INFO L471 AbstractCegarLoop]: Abstraction has 46897 states and 75018 transitions. [2024-11-11 22:09:34,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 46897 states and 75018 transitions. [2024-11-11 22:09:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 22:09:34,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:09:34,192 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:09:34,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:09:34,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:09:34,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:09:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1204366629, now seen corresponding path program 1 times [2024-11-11 22:09:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:09:34,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736946061] [2024-11-11 22:09:34,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:09:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:09:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:09:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:34,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 22:09:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:09:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 22:09:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 22:09:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:09:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:09:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:09:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736946061] [2024-11-11 22:09:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736946061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:09:34,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:09:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:09:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058725038] [2024-11-11 22:09:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:09:34,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:09:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:09:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:09:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:09:34,452 INFO L87 Difference]: Start difference. First operand 46897 states and 75018 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:09:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:09:43,628 INFO L93 Difference]: Finished difference Result 163366 states and 263489 transitions. [2024-11-11 22:09:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:09:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2024-11-11 22:09:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:09:44,319 INFO L225 Difference]: With dead ends: 163366 [2024-11-11 22:09:44,320 INFO L226 Difference]: Without dead ends: 118609