./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/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/locks/test_locks_13.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.graphml --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 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:10:22,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:10:22,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:10:22,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:10:22,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:10:22,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:10:22,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:10:22,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:10:22,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:10:22,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:10:22,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:10:22,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:10:22,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:10:22,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:10:22,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:10:22,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:10:22,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:10:22,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:10:22,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:10:22,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:10:22,320 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:10:22,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:10:22,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:10:22,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:10:22,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:10:22,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:10:22,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:10:22,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:10:22,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:10:22,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:10:22,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:10:22,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:10:22,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:10:22,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:10:22,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:10:22,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:10:22,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:10:22,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:10:22,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:10:22,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:10:22,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:10:22,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:10:22,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:10:22,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:10:22,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:10:22,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:10:22,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:10:22,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:10:22,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:10:22,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:10:22,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:10:22,375 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:10:22,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:10:22,376 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:10:22,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:10:22,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:10:22,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:10:22,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:10:22,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:10:22,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:10:22,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:10:22,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:10:22,379 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:10:22,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:10:22,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:10:22,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:10:22,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:10:22,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:10:22,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:10:22,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:10:22,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:10:22,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:10:22,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:10:22,381 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:10:22,381 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:10:22,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:10:22,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2022-07-22 11:10:22,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:10:22,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:10:22,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:10:22,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:10:22,673 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:10:22,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_13.c [2022-07-22 11:10:22,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd3545f/548481289cc140339cc9e5840de44ea9/FLAG2190f0a4f [2022-07-22 11:10:23,060 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:10:23,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c [2022-07-22 11:10:23,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd3545f/548481289cc140339cc9e5840de44ea9/FLAG2190f0a4f [2022-07-22 11:10:23,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd3545f/548481289cc140339cc9e5840de44ea9 [2022-07-22 11:10:23,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:10:23,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:10:23,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:10:23,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:10:23,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:10:23,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116b243b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23, skipping insertion in model container [2022-07-22 11:10:23,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:10:23,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:10:23,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-07-22 11:10:23,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:10:23,363 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:10:23,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_13.c[4936,4949] [2022-07-22 11:10:23,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:10:23,400 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:10:23,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23 WrapperNode [2022-07-22 11:10:23,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:10:23,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:10:23,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:10:23,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:10:23,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,435 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 171 [2022-07-22 11:10:23,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:10:23,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:10:23,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:10:23,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:10:23,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:10:23,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:10:23,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:10:23,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:10:23,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (1/1) ... [2022-07-22 11:10:23,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:10:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:10:23,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:10:23,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:10:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:10:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:10:23,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:10:23,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:10:23,602 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:10:23,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:10:23,819 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:10:23,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:10:23,825 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:10:23,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:10:23 BoogieIcfgContainer [2022-07-22 11:10:23,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:10:23,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:10:23,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:10:23,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:10:23,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:10:23" (1/3) ... [2022-07-22 11:10:23,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3826eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:10:23, skipping insertion in model container [2022-07-22 11:10:23,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:10:23" (2/3) ... [2022-07-22 11:10:23,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3826eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:10:23, skipping insertion in model container [2022-07-22 11:10:23,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:10:23" (3/3) ... [2022-07-22 11:10:23,851 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2022-07-22 11:10:23,863 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:10:23,865 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:10:23,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:10:23,921 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33c54ae2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ed1f309 [2022-07-22 11:10:23,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:10:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 11:10:23,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:23,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:10:23,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1359894467, now seen corresponding path program 1 times [2022-07-22 11:10:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:23,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181956077] [2022-07-22 11:10:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181956077] [2022-07-22 11:10:24,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181956077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129671237] [2022-07-22 11:10:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,131 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 48 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,193 INFO L93 Difference]: Finished difference Result 101 states and 181 transitions. [2022-07-22 11:10:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 11:10:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,210 INFO L225 Difference]: With dead ends: 101 [2022-07-22 11:10:24,210 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 11:10:24,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,217 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 11:10:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2022-07-22 11:10:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.896551724137931) internal successors, (110), 58 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 110 transitions. [2022-07-22 11:10:24,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 110 transitions. Word has length 20 [2022-07-22 11:10:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,259 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 110 transitions. [2022-07-22 11:10:24,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 110 transitions. [2022-07-22 11:10:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 11:10:24,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:10:24,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:10:24,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1914004475, now seen corresponding path program 1 times [2022-07-22 11:10:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451115656] [2022-07-22 11:10:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451115656] [2022-07-22 11:10:24,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451115656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081507928] [2022-07-22 11:10:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,355 INFO L87 Difference]: Start difference. First operand 59 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,386 INFO L93 Difference]: Finished difference Result 144 states and 269 transitions. [2022-07-22 11:10:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 11:10:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,391 INFO L225 Difference]: With dead ends: 144 [2022-07-22 11:10:24,391 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 11:10:24,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,396 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 11:10:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-07-22 11:10:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.880952380952381) internal successors, (158), 84 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 158 transitions. [2022-07-22 11:10:24,429 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 158 transitions. Word has length 20 [2022-07-22 11:10:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,430 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 158 transitions. [2022-07-22 11:10:24,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 158 transitions. [2022-07-22 11:10:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 11:10:24,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:10:24,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:10:24,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 793156859, now seen corresponding path program 1 times [2022-07-22 11:10:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104251154] [2022-07-22 11:10:24,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104251154] [2022-07-22 11:10:24,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104251154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460169662] [2022-07-22 11:10:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,508 INFO L87 Difference]: Start difference. First operand 85 states and 158 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,541 INFO L93 Difference]: Finished difference Result 132 states and 240 transitions. [2022-07-22 11:10:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 11:10:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,543 INFO L225 Difference]: With dead ends: 132 [2022-07-22 11:10:24,544 INFO L226 Difference]: Without dead ends: 90 [2022-07-22 11:10:24,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,547 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-22 11:10:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-07-22 11:10:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.839080459770115) internal successors, (160), 87 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2022-07-22 11:10:24,558 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 21 [2022-07-22 11:10:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,559 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2022-07-22 11:10:24,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2022-07-22 11:10:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 11:10:24,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:10:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:10:24,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -795191043, now seen corresponding path program 1 times [2022-07-22 11:10:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366119765] [2022-07-22 11:10:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366119765] [2022-07-22 11:10:24,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366119765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047973337] [2022-07-22 11:10:24,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,617 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,627 INFO L93 Difference]: Finished difference Result 169 states and 309 transitions. [2022-07-22 11:10:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 11:10:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,629 INFO L225 Difference]: With dead ends: 169 [2022-07-22 11:10:24,629 INFO L226 Difference]: Without dead ends: 167 [2022-07-22 11:10:24,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,630 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-22 11:10:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2022-07-22 11:10:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.8362068965517242) internal successors, (213), 116 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 213 transitions. [2022-07-22 11:10:24,641 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 213 transitions. Word has length 21 [2022-07-22 11:10:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,641 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 213 transitions. [2022-07-22 11:10:24,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 213 transitions. [2022-07-22 11:10:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 11:10:24,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:10:24,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:10:24,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1816259397, now seen corresponding path program 1 times [2022-07-22 11:10:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913224531] [2022-07-22 11:10:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913224531] [2022-07-22 11:10:24,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913224531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210657797] [2022-07-22 11:10:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,703 INFO L87 Difference]: Start difference. First operand 117 states and 213 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,714 INFO L93 Difference]: Finished difference Result 281 states and 515 transitions. [2022-07-22 11:10:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-22 11:10:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,716 INFO L225 Difference]: With dead ends: 281 [2022-07-22 11:10:24,716 INFO L226 Difference]: Without dead ends: 169 [2022-07-22 11:10:24,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,718 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-22 11:10:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2022-07-22 11:10:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.8253012048192772) internal successors, (303), 166 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 303 transitions. [2022-07-22 11:10:24,727 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 303 transitions. Word has length 21 [2022-07-22 11:10:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,727 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 303 transitions. [2022-07-22 11:10:24,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 303 transitions. [2022-07-22 11:10:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 11:10:24,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,728 INFO L195 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] [2022-07-22 11:10:24,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:10:24,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1119094160, now seen corresponding path program 1 times [2022-07-22 11:10:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616948637] [2022-07-22 11:10:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616948637] [2022-07-22 11:10:24,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616948637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312223212] [2022-07-22 11:10:24,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,762 INFO L87 Difference]: Start difference. First operand 167 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,777 INFO L93 Difference]: Finished difference Result 252 states and 454 transitions. [2022-07-22 11:10:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 11:10:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,778 INFO L225 Difference]: With dead ends: 252 [2022-07-22 11:10:24,778 INFO L226 Difference]: Without dead ends: 171 [2022-07-22 11:10:24,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,780 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-22 11:10:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2022-07-22 11:10:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 168 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 303 transitions. [2022-07-22 11:10:24,789 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 303 transitions. Word has length 22 [2022-07-22 11:10:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,789 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 303 transitions. [2022-07-22 11:10:24,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2022-07-22 11:10:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 11:10:24,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,790 INFO L195 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] [2022-07-22 11:10:24,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:10:24,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash -469253742, now seen corresponding path program 1 times [2022-07-22 11:10:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375018586] [2022-07-22 11:10:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375018586] [2022-07-22 11:10:24,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375018586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597989801] [2022-07-22 11:10:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,825 INFO L87 Difference]: Start difference. First operand 169 states and 303 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,836 INFO L93 Difference]: Finished difference Result 489 states and 881 transitions. [2022-07-22 11:10:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 11:10:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,838 INFO L225 Difference]: With dead ends: 489 [2022-07-22 11:10:24,838 INFO L226 Difference]: Without dead ends: 327 [2022-07-22 11:10:24,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,840 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-22 11:10:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2022-07-22 11:10:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.787037037037037) internal successors, (579), 324 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 579 transitions. [2022-07-22 11:10:24,850 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 579 transitions. Word has length 22 [2022-07-22 11:10:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,851 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 579 transitions. [2022-07-22 11:10:24,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 579 transitions. [2022-07-22 11:10:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 11:10:24,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,852 INFO L195 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] [2022-07-22 11:10:24,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:10:24,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 551814612, now seen corresponding path program 1 times [2022-07-22 11:10:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427634531] [2022-07-22 11:10:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427634531] [2022-07-22 11:10:24,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427634531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498179514] [2022-07-22 11:10:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,896 INFO L87 Difference]: Start difference. First operand 325 states and 579 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,915 INFO L93 Difference]: Finished difference Result 417 states and 749 transitions. [2022-07-22 11:10:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 11:10:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,917 INFO L225 Difference]: With dead ends: 417 [2022-07-22 11:10:24,917 INFO L226 Difference]: Without dead ends: 415 [2022-07-22 11:10:24,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,919 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-22 11:10:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2022-07-22 11:10:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.7746913580246915) internal successors, (575), 324 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 575 transitions. [2022-07-22 11:10:24,931 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 575 transitions. Word has length 22 [2022-07-22 11:10:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,932 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 575 transitions. [2022-07-22 11:10:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 575 transitions. [2022-07-22 11:10:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 11:10:24,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,934 INFO L195 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] [2022-07-22 11:10:24,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:10:24,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1661751056, now seen corresponding path program 1 times [2022-07-22 11:10:24,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255453629] [2022-07-22 11:10:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255453629] [2022-07-22 11:10:24,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255453629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:24,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:24,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041454175] [2022-07-22 11:10:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:24,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,959 INFO L87 Difference]: Start difference. First operand 325 states and 575 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:24,970 INFO L93 Difference]: Finished difference Result 613 states and 1097 transitions. [2022-07-22 11:10:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 11:10:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:24,973 INFO L225 Difference]: With dead ends: 613 [2022-07-22 11:10:24,973 INFO L226 Difference]: Without dead ends: 611 [2022-07-22 11:10:24,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:24,974 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:24,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-07-22 11:10:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2022-07-22 11:10:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.7477678571428572) internal successors, (783), 448 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 783 transitions. [2022-07-22 11:10:24,985 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 783 transitions. Word has length 23 [2022-07-22 11:10:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:24,985 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 783 transitions. [2022-07-22 11:10:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 783 transitions. [2022-07-22 11:10:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 11:10:24,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:24,987 INFO L195 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] [2022-07-22 11:10:24,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:10:24,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1612147886, now seen corresponding path program 1 times [2022-07-22 11:10:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:24,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709663687] [2022-07-22 11:10:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709663687] [2022-07-22 11:10:25,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709663687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618340472] [2022-07-22 11:10:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,011 INFO L87 Difference]: Start difference. First operand 449 states and 783 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,026 INFO L93 Difference]: Finished difference Result 1077 states and 1889 transitions. [2022-07-22 11:10:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 11:10:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,028 INFO L225 Difference]: With dead ends: 1077 [2022-07-22 11:10:25,028 INFO L226 Difference]: Without dead ends: 635 [2022-07-22 11:10:25,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,029 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-07-22 11:10:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2022-07-22 11:10:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.7389240506329113) internal successors, (1099), 632 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1099 transitions. [2022-07-22 11:10:25,043 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1099 transitions. Word has length 23 [2022-07-22 11:10:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,043 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1099 transitions. [2022-07-22 11:10:25,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1099 transitions. [2022-07-22 11:10:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:10:25,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,045 INFO L195 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] [2022-07-22 11:10:25,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:10:25,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 25538215, now seen corresponding path program 1 times [2022-07-22 11:10:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065902091] [2022-07-22 11:10:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065902091] [2022-07-22 11:10:25,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065902091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275791737] [2022-07-22 11:10:25,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,068 INFO L87 Difference]: Start difference. First operand 633 states and 1099 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,081 INFO L93 Difference]: Finished difference Result 957 states and 1657 transitions. [2022-07-22 11:10:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 11:10:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,084 INFO L225 Difference]: With dead ends: 957 [2022-07-22 11:10:25,084 INFO L226 Difference]: Without dead ends: 647 [2022-07-22 11:10:25,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,086 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-22 11:10:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2022-07-22 11:10:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.718944099378882) internal successors, (1107), 644 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1107 transitions. [2022-07-22 11:10:25,099 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1107 transitions. Word has length 24 [2022-07-22 11:10:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,099 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1107 transitions. [2022-07-22 11:10:25,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1107 transitions. [2022-07-22 11:10:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:10:25,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,101 INFO L195 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] [2022-07-22 11:10:25,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:10:25,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1562809687, now seen corresponding path program 1 times [2022-07-22 11:10:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327777597] [2022-07-22 11:10:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327777597] [2022-07-22 11:10:25,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327777597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908017153] [2022-07-22 11:10:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,123 INFO L87 Difference]: Start difference. First operand 645 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,147 INFO L93 Difference]: Finished difference Result 1193 states and 2077 transitions. [2022-07-22 11:10:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 11:10:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,152 INFO L225 Difference]: With dead ends: 1193 [2022-07-22 11:10:25,152 INFO L226 Difference]: Without dead ends: 1191 [2022-07-22 11:10:25,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,153 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-07-22 11:10:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 901. [2022-07-22 11:10:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.6833333333333333) internal successors, (1515), 900 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1515 transitions. [2022-07-22 11:10:25,173 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1515 transitions. Word has length 24 [2022-07-22 11:10:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,173 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1515 transitions. [2022-07-22 11:10:25,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1515 transitions. [2022-07-22 11:10:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 11:10:25,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,175 INFO L195 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] [2022-07-22 11:10:25,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:10:25,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1711089255, now seen corresponding path program 1 times [2022-07-22 11:10:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461315928] [2022-07-22 11:10:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461315928] [2022-07-22 11:10:25,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461315928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729590980] [2022-07-22 11:10:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,196 INFO L87 Difference]: Start difference. First operand 901 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,216 INFO L93 Difference]: Finished difference Result 2137 states and 3613 transitions. [2022-07-22 11:10:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 11:10:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,221 INFO L225 Difference]: With dead ends: 2137 [2022-07-22 11:10:25,221 INFO L226 Difference]: Without dead ends: 1255 [2022-07-22 11:10:25,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,223 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2022-07-22 11:10:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1253. [2022-07-22 11:10:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.676517571884984) internal successors, (2099), 1252 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2099 transitions. [2022-07-22 11:10:25,248 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2099 transitions. Word has length 24 [2022-07-22 11:10:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,249 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 2099 transitions. [2022-07-22 11:10:25,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2099 transitions. [2022-07-22 11:10:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 11:10:25,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,250 INFO L195 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] [2022-07-22 11:10:25,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:10:25,251 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1202246301, now seen corresponding path program 1 times [2022-07-22 11:10:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671463947] [2022-07-22 11:10:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671463947] [2022-07-22 11:10:25,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671463947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606213024] [2022-07-22 11:10:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,271 INFO L87 Difference]: Start difference. First operand 1253 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,291 INFO L93 Difference]: Finished difference Result 1881 states and 3141 transitions. [2022-07-22 11:10:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-22 11:10:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,296 INFO L225 Difference]: With dead ends: 1881 [2022-07-22 11:10:25,296 INFO L226 Difference]: Without dead ends: 1271 [2022-07-22 11:10:25,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,297 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-07-22 11:10:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2022-07-22 11:10:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.6553627760252365) internal successors, (2099), 1268 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2099 transitions. [2022-07-22 11:10:25,342 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2099 transitions. Word has length 25 [2022-07-22 11:10:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,342 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 2099 transitions. [2022-07-22 11:10:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2099 transitions. [2022-07-22 11:10:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 11:10:25,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,344 INFO L195 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] [2022-07-22 11:10:25,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:10:25,344 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1504373093, now seen corresponding path program 1 times [2022-07-22 11:10:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224172505] [2022-07-22 11:10:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224172505] [2022-07-22 11:10:25,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224172505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488088416] [2022-07-22 11:10:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,365 INFO L87 Difference]: Start difference. First operand 1269 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,412 INFO L93 Difference]: Finished difference Result 2313 states and 3893 transitions. [2022-07-22 11:10:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-22 11:10:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,419 INFO L225 Difference]: With dead ends: 2313 [2022-07-22 11:10:25,419 INFO L226 Difference]: Without dead ends: 2311 [2022-07-22 11:10:25,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,423 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-22 11:10:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1797. [2022-07-22 11:10:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1796 states have (on average 1.614142538975501) internal successors, (2899), 1796 states have internal predecessors, (2899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2899 transitions. [2022-07-22 11:10:25,475 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2899 transitions. Word has length 25 [2022-07-22 11:10:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,475 INFO L495 AbstractCegarLoop]: Abstraction has 1797 states and 2899 transitions. [2022-07-22 11:10:25,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2899 transitions. [2022-07-22 11:10:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 11:10:25,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,477 INFO L195 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] [2022-07-22 11:10:25,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:10:25,477 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,478 INFO L85 PathProgramCache]: Analyzing trace with hash 483304739, now seen corresponding path program 1 times [2022-07-22 11:10:25,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385242304] [2022-07-22 11:10:25,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385242304] [2022-07-22 11:10:25,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385242304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236282922] [2022-07-22 11:10:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,513 INFO L87 Difference]: Start difference. First operand 1797 states and 2899 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,549 INFO L93 Difference]: Finished difference Result 4233 states and 6869 transitions. [2022-07-22 11:10:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-22 11:10:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,557 INFO L225 Difference]: With dead ends: 4233 [2022-07-22 11:10:25,557 INFO L226 Difference]: Without dead ends: 2471 [2022-07-22 11:10:25,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,562 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-07-22 11:10:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2469. [2022-07-22 11:10:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2468 states have (on average 1.608995137763371) internal successors, (3971), 2468 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3971 transitions. [2022-07-22 11:10:25,635 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3971 transitions. Word has length 25 [2022-07-22 11:10:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,635 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3971 transitions. [2022-07-22 11:10:25,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3971 transitions. [2022-07-22 11:10:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 11:10:25,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,638 INFO L195 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] [2022-07-22 11:10:25,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:10:25,638 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash -608860292, now seen corresponding path program 1 times [2022-07-22 11:10:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745099263] [2022-07-22 11:10:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745099263] [2022-07-22 11:10:25,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745099263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809475040] [2022-07-22 11:10:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,664 INFO L87 Difference]: Start difference. First operand 2469 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,700 INFO L93 Difference]: Finished difference Result 3705 states and 5941 transitions. [2022-07-22 11:10:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 11:10:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,708 INFO L225 Difference]: With dead ends: 3705 [2022-07-22 11:10:25,708 INFO L226 Difference]: Without dead ends: 2503 [2022-07-22 11:10:25,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,710 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-07-22 11:10:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2022-07-22 11:10:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.5884) internal successors, (3971), 2500 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3971 transitions. [2022-07-22 11:10:25,767 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3971 transitions. Word has length 26 [2022-07-22 11:10:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,767 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 3971 transitions. [2022-07-22 11:10:25,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3971 transitions. [2022-07-22 11:10:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 11:10:25,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,769 INFO L195 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] [2022-07-22 11:10:25,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:10:25,769 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2097759102, now seen corresponding path program 1 times [2022-07-22 11:10:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166085040] [2022-07-22 11:10:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166085040] [2022-07-22 11:10:25,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166085040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366014582] [2022-07-22 11:10:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,786 INFO L87 Difference]: Start difference. First operand 2501 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:25,830 INFO L93 Difference]: Finished difference Result 4489 states and 7269 transitions. [2022-07-22 11:10:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 11:10:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:25,845 INFO L225 Difference]: With dead ends: 4489 [2022-07-22 11:10:25,846 INFO L226 Difference]: Without dead ends: 4487 [2022-07-22 11:10:25,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,848 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:25,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-07-22 11:10:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 3589. [2022-07-22 11:10:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3588 states have (on average 1.5437569676700111) internal successors, (5539), 3588 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5539 transitions. [2022-07-22 11:10:25,967 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5539 transitions. Word has length 26 [2022-07-22 11:10:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:25,967 INFO L495 AbstractCegarLoop]: Abstraction has 3589 states and 5539 transitions. [2022-07-22 11:10:25,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5539 transitions. [2022-07-22 11:10:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 11:10:25,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:25,972 INFO L195 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] [2022-07-22 11:10:25,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:10:25,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1076690748, now seen corresponding path program 1 times [2022-07-22 11:10:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:25,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776879831] [2022-07-22 11:10:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:25,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776879831] [2022-07-22 11:10:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776879831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:25,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:25,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861655370] [2022-07-22 11:10:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:25,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:25,990 INFO L87 Difference]: Start difference. First operand 3589 states and 5539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:26,059 INFO L93 Difference]: Finished difference Result 8393 states and 13029 transitions. [2022-07-22 11:10:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:26,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 11:10:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:26,090 INFO L225 Difference]: With dead ends: 8393 [2022-07-22 11:10:26,090 INFO L226 Difference]: Without dead ends: 4871 [2022-07-22 11:10:26,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,095 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:26,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-07-22 11:10:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4869. [2022-07-22 11:10:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.538824979457683) internal successors, (7491), 4868 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7491 transitions. [2022-07-22 11:10:26,216 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7491 transitions. Word has length 26 [2022-07-22 11:10:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:26,216 INFO L495 AbstractCegarLoop]: Abstraction has 4869 states and 7491 transitions. [2022-07-22 11:10:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7491 transitions. [2022-07-22 11:10:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 11:10:26,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:26,223 INFO L195 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] [2022-07-22 11:10:26,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:10:26,223 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 606237144, now seen corresponding path program 1 times [2022-07-22 11:10:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:26,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575881378] [2022-07-22 11:10:26,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:26,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575881378] [2022-07-22 11:10:26,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575881378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:26,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:26,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492819384] [2022-07-22 11:10:26,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:26,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,255 INFO L87 Difference]: Start difference. First operand 4869 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:26,316 INFO L93 Difference]: Finished difference Result 7305 states and 11205 transitions. [2022-07-22 11:10:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:26,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-22 11:10:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:26,325 INFO L225 Difference]: With dead ends: 7305 [2022-07-22 11:10:26,325 INFO L226 Difference]: Without dead ends: 4935 [2022-07-22 11:10:26,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,330 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:26,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2022-07-22 11:10:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4933. [2022-07-22 11:10:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4933 states, 4932 states have (on average 1.5188564476885644) internal successors, (7491), 4932 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7491 transitions. [2022-07-22 11:10:26,467 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7491 transitions. Word has length 27 [2022-07-22 11:10:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:26,467 INFO L495 AbstractCegarLoop]: Abstraction has 4933 states and 7491 transitions. [2022-07-22 11:10:26,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7491 transitions. [2022-07-22 11:10:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 11:10:26,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:26,473 INFO L195 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] [2022-07-22 11:10:26,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:10:26,473 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -982110758, now seen corresponding path program 1 times [2022-07-22 11:10:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:26,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91518805] [2022-07-22 11:10:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:26,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91518805] [2022-07-22 11:10:26,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91518805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:26,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:26,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108105587] [2022-07-22 11:10:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:26,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,492 INFO L87 Difference]: Start difference. First operand 4933 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:26,572 INFO L93 Difference]: Finished difference Result 8713 states and 13509 transitions. [2022-07-22 11:10:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-22 11:10:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:26,588 INFO L225 Difference]: With dead ends: 8713 [2022-07-22 11:10:26,589 INFO L226 Difference]: Without dead ends: 8711 [2022-07-22 11:10:26,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,592 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:26,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8711 states. [2022-07-22 11:10:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8711 to 7173. [2022-07-22 11:10:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7172 states have (on average 1.4728109313998885) internal successors, (10563), 7172 states have internal predecessors, (10563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 10563 transitions. [2022-07-22 11:10:26,751 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 10563 transitions. Word has length 27 [2022-07-22 11:10:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:26,752 INFO L495 AbstractCegarLoop]: Abstraction has 7173 states and 10563 transitions. [2022-07-22 11:10:26,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 10563 transitions. [2022-07-22 11:10:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 11:10:26,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:26,760 INFO L195 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] [2022-07-22 11:10:26,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:10:26,760 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:26,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2003179112, now seen corresponding path program 1 times [2022-07-22 11:10:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919541222] [2022-07-22 11:10:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:26,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919541222] [2022-07-22 11:10:26,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919541222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:26,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:26,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58303263] [2022-07-22 11:10:26,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:26,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:26,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,777 INFO L87 Difference]: Start difference. First operand 7173 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:26,885 INFO L93 Difference]: Finished difference Result 16649 states and 24645 transitions. [2022-07-22 11:10:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-22 11:10:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:26,943 INFO L225 Difference]: With dead ends: 16649 [2022-07-22 11:10:26,943 INFO L226 Difference]: Without dead ends: 9607 [2022-07-22 11:10:26,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:26,949 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:26,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 192 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2022-07-22 11:10:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2022-07-22 11:10:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4663681799250312) internal successors, (14083), 9604 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 14083 transitions. [2022-07-22 11:10:27,175 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 14083 transitions. Word has length 27 [2022-07-22 11:10:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:27,175 INFO L495 AbstractCegarLoop]: Abstraction has 9605 states and 14083 transitions. [2022-07-22 11:10:27,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 14083 transitions. [2022-07-22 11:10:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 11:10:27,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:27,184 INFO L195 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] [2022-07-22 11:10:27,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:10:27,185 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -380447663, now seen corresponding path program 1 times [2022-07-22 11:10:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466271653] [2022-07-22 11:10:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:27,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:27,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466271653] [2022-07-22 11:10:27,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466271653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:27,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:27,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327926249] [2022-07-22 11:10:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:27,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:27,202 INFO L87 Difference]: Start difference. First operand 9605 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:27,285 INFO L93 Difference]: Finished difference Result 14409 states and 21061 transitions. [2022-07-22 11:10:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 11:10:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:27,302 INFO L225 Difference]: With dead ends: 14409 [2022-07-22 11:10:27,302 INFO L226 Difference]: Without dead ends: 9735 [2022-07-22 11:10:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:27,311 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:27,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-07-22 11:10:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9733. [2022-07-22 11:10:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9733 states, 9732 states have (on average 1.447081792026305) internal successors, (14083), 9732 states have internal predecessors, (14083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9733 states to 9733 states and 14083 transitions. [2022-07-22 11:10:27,560 INFO L78 Accepts]: Start accepts. Automaton has 9733 states and 14083 transitions. Word has length 28 [2022-07-22 11:10:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:27,560 INFO L495 AbstractCegarLoop]: Abstraction has 9733 states and 14083 transitions. [2022-07-22 11:10:27,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9733 states and 14083 transitions. [2022-07-22 11:10:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 11:10:27,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:27,570 INFO L195 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] [2022-07-22 11:10:27,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 11:10:27,570 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1968795565, now seen corresponding path program 1 times [2022-07-22 11:10:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:27,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753340699] [2022-07-22 11:10:27,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:27,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:27,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753340699] [2022-07-22 11:10:27,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753340699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:27,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:27,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196035233] [2022-07-22 11:10:27,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:27,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:27,589 INFO L87 Difference]: Start difference. First operand 9733 states and 14083 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:27,778 INFO L93 Difference]: Finished difference Result 16905 states and 24965 transitions. [2022-07-22 11:10:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 11:10:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:27,806 INFO L225 Difference]: With dead ends: 16905 [2022-07-22 11:10:27,807 INFO L226 Difference]: Without dead ends: 16903 [2022-07-22 11:10:27,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:27,810 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:27,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2022-07-22 11:10:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 14341. [2022-07-22 11:10:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.4016039051603906) internal successors, (20099), 14340 states have internal predecessors, (20099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 20099 transitions. [2022-07-22 11:10:28,105 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 20099 transitions. Word has length 28 [2022-07-22 11:10:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:28,106 INFO L495 AbstractCegarLoop]: Abstraction has 14341 states and 20099 transitions. [2022-07-22 11:10:28,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 20099 transitions. [2022-07-22 11:10:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 11:10:28,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:28,124 INFO L195 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] [2022-07-22 11:10:28,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 11:10:28,125 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1305103377, now seen corresponding path program 1 times [2022-07-22 11:10:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:28,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885926904] [2022-07-22 11:10:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885926904] [2022-07-22 11:10:28,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885926904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:28,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:28,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906732013] [2022-07-22 11:10:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:28,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:28,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:28,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:28,143 INFO L87 Difference]: Start difference. First operand 14341 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:28,362 INFO L93 Difference]: Finished difference Result 33033 states and 46469 transitions. [2022-07-22 11:10:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:28,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-22 11:10:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:28,396 INFO L225 Difference]: With dead ends: 33033 [2022-07-22 11:10:28,397 INFO L226 Difference]: Without dead ends: 18951 [2022-07-22 11:10:28,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:28,413 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:28,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 193 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18951 states. [2022-07-22 11:10:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18951 to 18949. [2022-07-22 11:10:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.3917563858982478) internal successors, (26371), 18948 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 26371 transitions. [2022-07-22 11:10:28,791 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 26371 transitions. Word has length 28 [2022-07-22 11:10:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:28,792 INFO L495 AbstractCegarLoop]: Abstraction has 18949 states and 26371 transitions. [2022-07-22 11:10:28,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 26371 transitions. [2022-07-22 11:10:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 11:10:28,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:28,808 INFO L195 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] [2022-07-22 11:10:28,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 11:10:28,809 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash -902905267, now seen corresponding path program 1 times [2022-07-22 11:10:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:28,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885574232] [2022-07-22 11:10:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885574232] [2022-07-22 11:10:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885574232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083400436] [2022-07-22 11:10:28,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:28,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:28,827 INFO L87 Difference]: Start difference. First operand 18949 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:29,065 INFO L93 Difference]: Finished difference Result 28425 states and 39429 transitions. [2022-07-22 11:10:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 11:10:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:29,103 INFO L225 Difference]: With dead ends: 28425 [2022-07-22 11:10:29,103 INFO L226 Difference]: Without dead ends: 19207 [2022-07-22 11:10:29,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:29,115 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:29,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19207 states. [2022-07-22 11:10:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19207 to 19205. [2022-07-22 11:10:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 19204 states have (on average 1.3732034992709852) internal successors, (26371), 19204 states have internal predecessors, (26371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 26371 transitions. [2022-07-22 11:10:29,520 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 26371 transitions. Word has length 29 [2022-07-22 11:10:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:29,520 INFO L495 AbstractCegarLoop]: Abstraction has 19205 states and 26371 transitions. [2022-07-22 11:10:29,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 26371 transitions. [2022-07-22 11:10:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 11:10:29,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:29,535 INFO L195 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] [2022-07-22 11:10:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 11:10:29,536 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1803714127, now seen corresponding path program 1 times [2022-07-22 11:10:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:29,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204093999] [2022-07-22 11:10:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:29,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204093999] [2022-07-22 11:10:29,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204093999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:29,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:29,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763755579] [2022-07-22 11:10:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:29,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:29,552 INFO L87 Difference]: Start difference. First operand 19205 states and 26371 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:29,893 INFO L93 Difference]: Finished difference Result 32777 states and 45829 transitions. [2022-07-22 11:10:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 11:10:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:29,938 INFO L225 Difference]: With dead ends: 32777 [2022-07-22 11:10:29,938 INFO L226 Difference]: Without dead ends: 32775 [2022-07-22 11:10:29,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:29,947 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:29,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:29,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32775 states. [2022-07-22 11:10:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32775 to 28677. [2022-07-22 11:10:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28677 states, 28676 states have (on average 1.3302761891477193) internal successors, (38147), 28676 states have internal predecessors, (38147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 38147 transitions. [2022-07-22 11:10:30,519 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 38147 transitions. Word has length 29 [2022-07-22 11:10:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:30,519 INFO L495 AbstractCegarLoop]: Abstraction has 28677 states and 38147 transitions. [2022-07-22 11:10:30,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 38147 transitions. [2022-07-22 11:10:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 11:10:30,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:30,547 INFO L195 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] [2022-07-22 11:10:30,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 11:10:30,548 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash 782645773, now seen corresponding path program 1 times [2022-07-22 11:10:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:30,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637267059] [2022-07-22 11:10:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:30,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:30,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637267059] [2022-07-22 11:10:30,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637267059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:30,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:30,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994089895] [2022-07-22 11:10:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:30,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:30,567 INFO L87 Difference]: Start difference. First operand 28677 states and 38147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:30,898 INFO L93 Difference]: Finished difference Result 65545 states and 87301 transitions. [2022-07-22 11:10:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:30,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 11:10:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:30,949 INFO L225 Difference]: With dead ends: 65545 [2022-07-22 11:10:30,949 INFO L226 Difference]: Without dead ends: 37383 [2022-07-22 11:10:30,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:30,984 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:30,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37383 states. [2022-07-22 11:10:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37383 to 37381. [2022-07-22 11:10:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37381 states, 37380 states have (on average 1.315008025682183) internal successors, (49155), 37380 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37381 states to 37381 states and 49155 transitions. [2022-07-22 11:10:31,968 INFO L78 Accepts]: Start accepts. Automaton has 37381 states and 49155 transitions. Word has length 29 [2022-07-22 11:10:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:31,969 INFO L495 AbstractCegarLoop]: Abstraction has 37381 states and 49155 transitions. [2022-07-22 11:10:31,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37381 states and 49155 transitions. [2022-07-22 11:10:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 11:10:31,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:31,992 INFO L195 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] [2022-07-22 11:10:31,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 11:10:31,993 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 80778534, now seen corresponding path program 1 times [2022-07-22 11:10:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:31,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564699650] [2022-07-22 11:10:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:32,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564699650] [2022-07-22 11:10:32,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564699650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:32,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:32,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900588911] [2022-07-22 11:10:32,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:32,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:32,011 INFO L87 Difference]: Start difference. First operand 37381 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:32,362 INFO L93 Difference]: Finished difference Result 56073 states and 73477 transitions. [2022-07-22 11:10:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:32,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 11:10:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:32,416 INFO L225 Difference]: With dead ends: 56073 [2022-07-22 11:10:32,416 INFO L226 Difference]: Without dead ends: 37895 [2022-07-22 11:10:32,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:32,445 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:32,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37895 states. [2022-07-22 11:10:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37895 to 37893. [2022-07-22 11:10:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37893 states, 37892 states have (on average 1.2972395228544285) internal successors, (49155), 37892 states have internal predecessors, (49155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37893 states to 37893 states and 49155 transitions. [2022-07-22 11:10:33,331 INFO L78 Accepts]: Start accepts. Automaton has 37893 states and 49155 transitions. Word has length 30 [2022-07-22 11:10:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:33,331 INFO L495 AbstractCegarLoop]: Abstraction has 37893 states and 49155 transitions. [2022-07-22 11:10:33,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 37893 states and 49155 transitions. [2022-07-22 11:10:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 11:10:33,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:33,353 INFO L195 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] [2022-07-22 11:10:33,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 11:10:33,354 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1507569368, now seen corresponding path program 1 times [2022-07-22 11:10:33,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:33,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289998639] [2022-07-22 11:10:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:33,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:33,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289998639] [2022-07-22 11:10:33,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289998639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:33,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:33,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36306854] [2022-07-22 11:10:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:33,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:33,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:33,370 INFO L87 Difference]: Start difference. First operand 37893 states and 49155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:34,017 INFO L93 Difference]: Finished difference Result 110601 states and 141317 transitions. [2022-07-22 11:10:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 11:10:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:34,095 INFO L225 Difference]: With dead ends: 110601 [2022-07-22 11:10:34,095 INFO L226 Difference]: Without dead ends: 73735 [2022-07-22 11:10:34,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:34,128 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:34,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73735 states. [2022-07-22 11:10:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73735 to 73733. [2022-07-22 11:10:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2499728747355288) internal successors, (92163), 73732 states have internal predecessors, (92163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 92163 transitions. [2022-07-22 11:10:35,303 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 92163 transitions. Word has length 30 [2022-07-22 11:10:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:35,303 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 92163 transitions. [2022-07-22 11:10:35,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 92163 transitions. [2022-07-22 11:10:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 11:10:35,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:35,531 INFO L195 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] [2022-07-22 11:10:35,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 11:10:35,532 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash -486501014, now seen corresponding path program 1 times [2022-07-22 11:10:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:35,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125460273] [2022-07-22 11:10:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:35,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125460273] [2022-07-22 11:10:35,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125460273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:35,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:35,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:35,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213120061] [2022-07-22 11:10:35,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:35,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:35,573 INFO L87 Difference]: Start difference. First operand 73733 states and 92163 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:36,172 INFO L93 Difference]: Finished difference Result 79881 states and 102405 transitions. [2022-07-22 11:10:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 11:10:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:36,252 INFO L225 Difference]: With dead ends: 79881 [2022-07-22 11:10:36,252 INFO L226 Difference]: Without dead ends: 79879 [2022-07-22 11:10:36,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:36,267 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 33 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:36,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 184 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79879 states. [2022-07-22 11:10:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79879 to 73733. [2022-07-22 11:10:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73733 states, 73732 states have (on average 1.2360847393262084) internal successors, (91139), 73732 states have internal predecessors, (91139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73733 states to 73733 states and 91139 transitions. [2022-07-22 11:10:37,471 INFO L78 Accepts]: Start accepts. Automaton has 73733 states and 91139 transitions. Word has length 30 [2022-07-22 11:10:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:37,471 INFO L495 AbstractCegarLoop]: Abstraction has 73733 states and 91139 transitions. [2022-07-22 11:10:37,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 73733 states and 91139 transitions. [2022-07-22 11:10:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 11:10:37,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:37,499 INFO L195 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] [2022-07-22 11:10:37,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-22 11:10:37,500 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 510205634, now seen corresponding path program 1 times [2022-07-22 11:10:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414534852] [2022-07-22 11:10:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:37,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414534852] [2022-07-22 11:10:37,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414534852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:37,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:37,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:37,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073178256] [2022-07-22 11:10:37,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:37,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:37,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:37,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:37,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:37,519 INFO L87 Difference]: Start difference. First operand 73733 states and 91139 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:38,471 INFO L93 Difference]: Finished difference Result 121865 states and 151557 transitions. [2022-07-22 11:10:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:38,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-22 11:10:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:38,599 INFO L225 Difference]: With dead ends: 121865 [2022-07-22 11:10:38,599 INFO L226 Difference]: Without dead ends: 121863 [2022-07-22 11:10:38,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:38,622 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:38,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121863 states. [2022-07-22 11:10:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121863 to 113669. [2022-07-22 11:10:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113669 states, 113668 states have (on average 1.2071911179927508) internal successors, (137219), 113668 states have internal predecessors, (137219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113669 states to 113669 states and 137219 transitions. [2022-07-22 11:10:40,253 INFO L78 Accepts]: Start accepts. Automaton has 113669 states and 137219 transitions. Word has length 31 [2022-07-22 11:10:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:40,253 INFO L495 AbstractCegarLoop]: Abstraction has 113669 states and 137219 transitions. [2022-07-22 11:10:40,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 113669 states and 137219 transitions. [2022-07-22 11:10:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 11:10:40,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:40,316 INFO L195 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] [2022-07-22 11:10:40,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-22 11:10:40,316 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -510862720, now seen corresponding path program 1 times [2022-07-22 11:10:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:40,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005129385] [2022-07-22 11:10:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005129385] [2022-07-22 11:10:40,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005129385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:40,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:40,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495528422] [2022-07-22 11:10:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:40,333 INFO L87 Difference]: Start difference. First operand 113669 states and 137219 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:41,805 INFO L93 Difference]: Finished difference Result 257033 states and 309253 transitions. [2022-07-22 11:10:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-22 11:10:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:41,966 INFO L225 Difference]: With dead ends: 257033 [2022-07-22 11:10:41,966 INFO L226 Difference]: Without dead ends: 144391 [2022-07-22 11:10:42,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:42,038 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:42,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144391 states. [2022-07-22 11:10:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144391 to 144389. [2022-07-22 11:10:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144389 states, 144388 states have (on average 1.177293126852647) internal successors, (169987), 144388 states have internal predecessors, (169987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144389 states to 144389 states and 169987 transitions. [2022-07-22 11:10:44,546 INFO L78 Accepts]: Start accepts. Automaton has 144389 states and 169987 transitions. Word has length 31 [2022-07-22 11:10:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:44,546 INFO L495 AbstractCegarLoop]: Abstraction has 144389 states and 169987 transitions. [2022-07-22 11:10:44,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 144389 states and 169987 transitions. [2022-07-22 11:10:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 11:10:44,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:44,613 INFO L195 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] [2022-07-22 11:10:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-22 11:10:44,614 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1363278403, now seen corresponding path program 1 times [2022-07-22 11:10:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:44,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36543915] [2022-07-22 11:10:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:44,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36543915] [2022-07-22 11:10:44,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36543915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:44,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:44,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780408449] [2022-07-22 11:10:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:44,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:44,632 INFO L87 Difference]: Start difference. First operand 144389 states and 169987 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:45,940 INFO L93 Difference]: Finished difference Result 218121 states and 257029 transitions. [2022-07-22 11:10:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 11:10:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:46,109 INFO L225 Difference]: With dead ends: 218121 [2022-07-22 11:10:46,109 INFO L226 Difference]: Without dead ends: 147463 [2022-07-22 11:10:46,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:46,171 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:46,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2022-07-22 11:10:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 147461. [2022-07-22 11:10:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147461 states, 147460 states have (on average 1.1666553641665536) internal successors, (172035), 147460 states have internal predecessors, (172035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147461 states to 147461 states and 172035 transitions. [2022-07-22 11:10:48,614 INFO L78 Accepts]: Start accepts. Automaton has 147461 states and 172035 transitions. Word has length 32 [2022-07-22 11:10:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:48,614 INFO L495 AbstractCegarLoop]: Abstraction has 147461 states and 172035 transitions. [2022-07-22 11:10:48,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 147461 states and 172035 transitions. [2022-07-22 11:10:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 11:10:48,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:48,685 INFO L195 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] [2022-07-22 11:10:48,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-22 11:10:48,685 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1343340991, now seen corresponding path program 1 times [2022-07-22 11:10:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:48,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843674474] [2022-07-22 11:10:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:48,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:48,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:48,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843674474] [2022-07-22 11:10:48,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843674474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:48,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839028327] [2022-07-22 11:10:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:48,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:48,700 INFO L87 Difference]: Start difference. First operand 147461 states and 172035 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:50,840 INFO L93 Difference]: Finished difference Result 237575 states and 274436 transitions. [2022-07-22 11:10:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 11:10:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:51,147 INFO L225 Difference]: With dead ends: 237575 [2022-07-22 11:10:51,148 INFO L226 Difference]: Without dead ends: 237573 [2022-07-22 11:10:51,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:51,194 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:51,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237573 states. [2022-07-22 11:10:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237573 to 229381. [2022-07-22 11:10:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229381 states, 229380 states have (on average 1.1428502920917256) internal successors, (262147), 229380 states have internal predecessors, (262147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229381 states to 229381 states and 262147 transitions. [2022-07-22 11:10:54,809 INFO L78 Accepts]: Start accepts. Automaton has 229381 states and 262147 transitions. Word has length 32 [2022-07-22 11:10:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:54,809 INFO L495 AbstractCegarLoop]: Abstraction has 229381 states and 262147 transitions. [2022-07-22 11:10:54,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 229381 states and 262147 transitions. [2022-07-22 11:10:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 11:10:55,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:10:55,017 INFO L195 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] [2022-07-22 11:10:55,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-22 11:10:55,017 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:10:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:10:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 322272637, now seen corresponding path program 1 times [2022-07-22 11:10:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:10:55,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319315596] [2022-07-22 11:10:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:10:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:10:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:10:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:10:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:10:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319315596] [2022-07-22 11:10:55,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319315596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:10:55,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:10:55,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:10:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848464227] [2022-07-22 11:10:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:10:55,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:10:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:10:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:10:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:55,032 INFO L87 Difference]: Start difference. First operand 229381 states and 262147 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:10:57,539 INFO L93 Difference]: Finished difference Result 512005 states and 577539 transitions. [2022-07-22 11:10:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:10:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 11:10:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:10:57,540 INFO L225 Difference]: With dead ends: 512005 [2022-07-22 11:10:57,540 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 11:10:57,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:10:57,688 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:10:57,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:10:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 11:10:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 11:10:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 11:10:57,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-07-22 11:10:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:10:57,690 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 11:10:57,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:10:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 11:10:57,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 11:10:57,693 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:10:57,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-22 11:10:57,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point L168(line 168) no Hoare annotation was computed. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point L152-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point L119-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,711 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L902 garLoopResultBuilder]: At program point L203(lines 7 207) the Hoare annotation is: true [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L137-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L138(line 138) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L902 garLoopResultBuilder]: At program point L206(lines 6 207) the Hoare annotation is: true [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-22 11:10:57,712 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,713 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L902 garLoopResultBuilder]: At program point L197-1(lines 50 202) the Hoare annotation is: true [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,714 INFO L899 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2022-07-22 11:10:57,715 INFO L895 garLoopResultBuilder]: At program point L198-1(lines 7 207) the Hoare annotation is: false [2022-07-22 11:10:57,715 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,715 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,715 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 85) no Hoare annotation was computed. [2022-07-22 11:10:57,715 INFO L899 garLoopResultBuilder]: For program point L83-2(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,715 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-22 11:10:57,715 INFO L899 garLoopResultBuilder]: For program point L167-1(lines 50 202) no Hoare annotation was computed. [2022-07-22 11:10:57,718 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-22 11:10:57,720 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:10:57,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:10:57 BoogieIcfgContainer [2022-07-22 11:10:57,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:10:57,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:10:57,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:10:57,727 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:10:57,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:10:23" (3/4) ... [2022-07-22 11:10:57,730 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 11:10:57,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-22 11:10:57,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 11:10:57,739 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 11:10:57,740 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 11:10:57,773 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:10:57,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:10:57,774 INFO L158 Benchmark]: Toolchain (without parser) took 34685.49ms. Allocated memory was 83.9MB in the beginning and 14.7GB in the end (delta: 14.7GB). Free memory was 45.6MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2022-07-22 11:10:57,774 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:10:57,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.22ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 45.4MB in the beginning and 82.3MB in the end (delta: -36.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-07-22 11:10:57,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.32ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 80.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:10:57,775 INFO L158 Benchmark]: Boogie Preprocessor took 18.18ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:10:57,775 INFO L158 Benchmark]: RCFGBuilder took 371.88ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 64.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 11:10:57,775 INFO L158 Benchmark]: TraceAbstraction took 33887.12ms. Allocated memory was 109.1MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 64.5MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2022-07-22 11:10:57,776 INFO L158 Benchmark]: Witness Printer took 46.31ms. Allocated memory is still 14.7GB. Free memory was 11.3GB in the beginning and 11.3GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:10:57,777 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.22ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 45.4MB in the beginning and 82.3MB in the end (delta: -36.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.32ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 80.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.18ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 79.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.88ms. Allocated memory is still 109.1MB. Free memory was 79.0MB in the beginning and 64.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33887.12ms. Allocated memory was 109.1MB in the beginning and 14.7GB in the end (delta: 14.6GB). Free memory was 64.5MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 46.31ms. Allocated memory is still 14.7GB. Free memory was 11.3GB in the beginning and 11.3GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 36, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.9s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1926 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1926 mSDsluCounter, 6369 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2568 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 3801 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229381occurred in iteration=35, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-22 11:10:57,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE