./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:59:17,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:59:17,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:59:17,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:59:17,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:59:17,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:59:17,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:59:17,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:59:17,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:59:17,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:59:17,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:59:17,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:59:17,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:59:17,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:59:17,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:59:17,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:59:17,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:59:17,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:59:17,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:59:17,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:59:17,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:59:17,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:59:17,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:59:17,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:59:17,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:59:17,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:59:17,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:59:17,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:59:17,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:59:17,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:59:17,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:59:17,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:59:17,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:59:17,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:59:17,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:59:17,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:59:17,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:59:17,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:59:17,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:59:17,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:59:17,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:59:17,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:59:17,535 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:59:17,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:59:17,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:59:17,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:59:17,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:59:17,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:59:17,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:59:17,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:59:17,538 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:59:17,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:59:17,539 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:59:17,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:59:17,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:59:17,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:59:17,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:59:17,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:59:17,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:59:17,540 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:59:17,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:59:17,540 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:59:17,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:59:17,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:59:17,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:59:17,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:59:17,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:59:17,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:59:17,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:59:17,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:59:17,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:59:17,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:59:17,542 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:59:17,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:59:17,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:59:17,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:59:17,543 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2021-12-15 21:59:17,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:59:17,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:59:17,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:59:17,752 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:59:17,753 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:59:17,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2021-12-15 21:59:17,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e004fc3f8/72a90ffbd5d240e598d8f6b3d7ab959d/FLAGd60791f65 [2021-12-15 21:59:18,191 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:59:18,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2021-12-15 21:59:18,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e004fc3f8/72a90ffbd5d240e598d8f6b3d7ab959d/FLAGd60791f65 [2021-12-15 21:59:18,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e004fc3f8/72a90ffbd5d240e598d8f6b3d7ab959d [2021-12-15 21:59:18,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:59:18,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:59:18,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:59:18,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:59:18,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:59:18,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5960c6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18, skipping insertion in model container [2021-12-15 21:59:18,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:59:18,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:59:18,382 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_12.c[4591,4604] [2021-12-15 21:59:18,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:59:18,389 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:59:18,405 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_12.c[4591,4604] [2021-12-15 21:59:18,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:59:18,415 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:59:18,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18 WrapperNode [2021-12-15 21:59:18,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:59:18,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:59:18,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:59:18,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:59:18,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,468 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2021-12-15 21:59:18,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:59:18,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:59:18,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:59:18,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:59:18,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:59:18,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:59:18,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:59:18,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:59:18,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (1/1) ... [2021-12-15 21:59:18,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:59:18,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:59:18,527 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) [2021-12-15 21:59:18,529 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 [2021-12-15 21:59:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:59:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:59:18,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:59:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:59:18,597 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:59:18,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:59:18,727 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:59:18,732 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:59:18,732 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 21:59:18,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:59:18 BoogieIcfgContainer [2021-12-15 21:59:18,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:59:18,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:59:18,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:59:18,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:59:18,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:59:18" (1/3) ... [2021-12-15 21:59:18,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ebd70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:59:18, skipping insertion in model container [2021-12-15 21:59:18,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:59:18" (2/3) ... [2021-12-15 21:59:18,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ebd70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:59:18, skipping insertion in model container [2021-12-15 21:59:18,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:59:18" (3/3) ... [2021-12-15 21:59:18,759 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2021-12-15 21:59:18,763 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:59:18,764 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:59:18,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:59:18,827 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 21:59:18,831 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:59:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 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) [2021-12-15 21:59:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 21:59:18,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:18,865 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:18,865 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2021-12-15 21:59:18,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:18,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288941622] [2021-12-15 21:59:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:18,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288941622] [2021-12-15 21:59:19,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288941622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068690527] [2021-12-15 21:59:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,109 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 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.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-15 21:59:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,155 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2021-12-15 21:59:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-12-15 21:59:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,168 INFO L225 Difference]: With dead ends: 95 [2021-12-15 21:59:19,168 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 21:59:19,171 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,178 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 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 [2021-12-15 21:59:19,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 21:59:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2021-12-15 21:59:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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) [2021-12-15 21:59:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2021-12-15 21:59:19,202 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2021-12-15 21:59:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,202 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2021-12-15 21:59:19,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-15 21:59:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2021-12-15 21:59:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 21:59:19,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:59:19,204 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2021-12-15 21:59:19,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998427729] [2021-12-15 21:59:19,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998427729] [2021-12-15 21:59:19,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998427729] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548620456] [2021-12-15 21:59:19,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,273 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-15 21:59:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,302 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2021-12-15 21:59:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-12-15 21:59:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,304 INFO L225 Difference]: With dead ends: 134 [2021-12-15 21:59:19,305 INFO L226 Difference]: Without dead ends: 81 [2021-12-15 21:59:19,306 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,307 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 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 [2021-12-15 21:59:19,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-15 21:59:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-12-15 21:59:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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) [2021-12-15 21:59:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2021-12-15 21:59:19,315 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2021-12-15 21:59:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,315 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2021-12-15 21:59:19,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2021-12-15 21:59:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2021-12-15 21:59:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 21:59:19,316 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:59:19,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2021-12-15 21:59:19,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335895613] [2021-12-15 21:59:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335895613] [2021-12-15 21:59:19,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335895613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952862084] [2021-12-15 21:59:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,353 INFO L87 Difference]: Start difference. First operand 79 states and 146 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) [2021-12-15 21:59:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,382 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2021-12-15 21:59:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,383 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 [2021-12-15 21:59:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,384 INFO L225 Difference]: With dead ends: 123 [2021-12-15 21:59:19,386 INFO L226 Difference]: Without dead ends: 84 [2021-12-15 21:59:19,387 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,388 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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 [2021-12-15 21:59:19,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-15 21:59:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2021-12-15 21:59:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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) [2021-12-15 21:59:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2021-12-15 21:59:19,398 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2021-12-15 21:59:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,399 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2021-12-15 21:59:19,399 INFO L471 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) [2021-12-15 21:59:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2021-12-15 21:59:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 21:59:19,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 21:59:19,408 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2021-12-15 21:59:19,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682078353] [2021-12-15 21:59:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682078353] [2021-12-15 21:59:19,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682078353] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767944009] [2021-12-15 21:59:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,437 INFO L87 Difference]: Start difference. First operand 82 states and 148 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) [2021-12-15 21:59:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,454 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2021-12-15 21:59:19,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,455 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 [2021-12-15 21:59:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,456 INFO L225 Difference]: With dead ends: 157 [2021-12-15 21:59:19,457 INFO L226 Difference]: Without dead ends: 155 [2021-12-15 21:59:19,457 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,458 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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 [2021-12-15 21:59:19,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-15 21:59:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-12-15 21:59:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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) [2021-12-15 21:59:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2021-12-15 21:59:19,472 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2021-12-15 21:59:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,473 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2021-12-15 21:59:19,473 INFO L471 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) [2021-12-15 21:59:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2021-12-15 21:59:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 21:59:19,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 21:59:19,475 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2021-12-15 21:59:19,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111508133] [2021-12-15 21:59:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111508133] [2021-12-15 21:59:19,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111508133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299072319] [2021-12-15 21:59:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,519 INFO L87 Difference]: Start difference. First operand 109 states and 197 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) [2021-12-15 21:59:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,530 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2021-12-15 21:59:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,530 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 [2021-12-15 21:59:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,531 INFO L225 Difference]: With dead ends: 261 [2021-12-15 21:59:19,531 INFO L226 Difference]: Without dead ends: 157 [2021-12-15 21:59:19,532 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,533 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 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 [2021-12-15 21:59:19,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-15 21:59:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2021-12-15 21:59:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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) [2021-12-15 21:59:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2021-12-15 21:59:19,541 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2021-12-15 21:59:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,542 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2021-12-15 21:59:19,542 INFO L471 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) [2021-12-15 21:59:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2021-12-15 21:59:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:59:19,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 21:59:19,543 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2021-12-15 21:59:19,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781391418] [2021-12-15 21:59:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781391418] [2021-12-15 21:59:19,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781391418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981192232] [2021-12-15 21:59:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,570 INFO L87 Difference]: Start difference. First operand 155 states and 279 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) [2021-12-15 21:59:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,578 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2021-12-15 21:59:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,579 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 [2021-12-15 21:59:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,580 INFO L225 Difference]: With dead ends: 234 [2021-12-15 21:59:19,580 INFO L226 Difference]: Without dead ends: 159 [2021-12-15 21:59:19,580 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,581 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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 [2021-12-15 21:59:19,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-15 21:59:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2021-12-15 21:59:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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) [2021-12-15 21:59:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2021-12-15 21:59:19,588 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2021-12-15 21:59:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,588 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2021-12-15 21:59:19,588 INFO L471 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) [2021-12-15 21:59:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2021-12-15 21:59:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:59:19,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 21:59:19,590 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2021-12-15 21:59:19,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476513827] [2021-12-15 21:59:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476513827] [2021-12-15 21:59:19,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476513827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888241376] [2021-12-15 21:59:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,615 INFO L87 Difference]: Start difference. First operand 157 states and 279 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) [2021-12-15 21:59:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,626 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2021-12-15 21:59:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,626 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 [2021-12-15 21:59:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,627 INFO L225 Difference]: With dead ends: 453 [2021-12-15 21:59:19,627 INFO L226 Difference]: Without dead ends: 303 [2021-12-15 21:59:19,628 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,629 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 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 [2021-12-15 21:59:19,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-15 21:59:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-12-15 21:59:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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) [2021-12-15 21:59:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2021-12-15 21:59:19,638 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2021-12-15 21:59:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,638 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2021-12-15 21:59:19,638 INFO L471 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) [2021-12-15 21:59:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2021-12-15 21:59:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:59:19,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 21:59:19,639 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2021-12-15 21:59:19,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116795958] [2021-12-15 21:59:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116795958] [2021-12-15 21:59:19,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116795958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623600806] [2021-12-15 21:59:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,678 INFO L87 Difference]: Start difference. First operand 301 states and 531 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) [2021-12-15 21:59:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,700 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2021-12-15 21:59:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,700 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 [2021-12-15 21:59:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,702 INFO L225 Difference]: With dead ends: 385 [2021-12-15 21:59:19,702 INFO L226 Difference]: Without dead ends: 383 [2021-12-15 21:59:19,702 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,703 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 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 [2021-12-15 21:59:19,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-12-15 21:59:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2021-12-15 21:59:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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) [2021-12-15 21:59:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2021-12-15 21:59:19,710 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2021-12-15 21:59:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,710 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2021-12-15 21:59:19,710 INFO L471 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) [2021-12-15 21:59:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2021-12-15 21:59:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 21:59:19,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 21:59:19,712 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2021-12-15 21:59:19,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429163929] [2021-12-15 21:59:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429163929] [2021-12-15 21:59:19,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429163929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404955783] [2021-12-15 21:59:19,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,740 INFO L87 Difference]: Start difference. First operand 301 states and 527 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) [2021-12-15 21:59:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,753 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2021-12-15 21:59:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,754 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 [2021-12-15 21:59:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,756 INFO L225 Difference]: With dead ends: 565 [2021-12-15 21:59:19,756 INFO L226 Difference]: Without dead ends: 563 [2021-12-15 21:59:19,756 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,757 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 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 [2021-12-15 21:59:19,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-12-15 21:59:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2021-12-15 21:59:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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) [2021-12-15 21:59:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2021-12-15 21:59:19,767 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2021-12-15 21:59:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,767 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2021-12-15 21:59:19,767 INFO L471 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) [2021-12-15 21:59:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2021-12-15 21:59:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 21:59:19,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:59:19,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 21:59:19,771 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2021-12-15 21:59:19,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688916592] [2021-12-15 21:59:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688916592] [2021-12-15 21:59:19,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688916592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720165716] [2021-12-15 21:59:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,804 INFO L87 Difference]: Start difference. First operand 417 states and 719 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) [2021-12-15 21:59:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,824 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2021-12-15 21:59:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,824 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 [2021-12-15 21:59:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,826 INFO L225 Difference]: With dead ends: 997 [2021-12-15 21:59:19,826 INFO L226 Difference]: Without dead ends: 587 [2021-12-15 21:59:19,827 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,828 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 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 [2021-12-15 21:59:19,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-12-15 21:59:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2021-12-15 21:59:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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) [2021-12-15 21:59:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2021-12-15 21:59:19,840 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2021-12-15 21:59:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,840 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2021-12-15 21:59:19,840 INFO L471 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) [2021-12-15 21:59:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2021-12-15 21:59:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 21:59:19,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,841 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:19,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 21:59:19,841 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2021-12-15 21:59:19,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965739981] [2021-12-15 21:59:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965739981] [2021-12-15 21:59:19,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965739981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166148205] [2021-12-15 21:59:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,862 INFO L87 Difference]: Start difference. First operand 585 states and 1003 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) [2021-12-15 21:59:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,877 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2021-12-15 21:59:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,878 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 [2021-12-15 21:59:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,880 INFO L225 Difference]: With dead ends: 885 [2021-12-15 21:59:19,880 INFO L226 Difference]: Without dead ends: 599 [2021-12-15 21:59:19,880 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,881 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 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 [2021-12-15 21:59:19,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-12-15 21:59:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2021-12-15 21:59:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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) [2021-12-15 21:59:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2021-12-15 21:59:19,901 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2021-12-15 21:59:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,901 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2021-12-15 21:59:19,901 INFO L471 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) [2021-12-15 21:59:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2021-12-15 21:59:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 21:59:19,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,904 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:19,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 21:59:19,905 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2021-12-15 21:59:19,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853665632] [2021-12-15 21:59:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:19,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:19,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853665632] [2021-12-15 21:59:19,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853665632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:19,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:19,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:19,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768927404] [2021-12-15 21:59:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:19,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:19,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:19,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:19,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:19,934 INFO L87 Difference]: Start difference. First operand 597 states and 1011 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) [2021-12-15 21:59:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:19,946 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2021-12-15 21:59:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:19,946 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 [2021-12-15 21:59:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:19,949 INFO L225 Difference]: With dead ends: 1097 [2021-12-15 21:59:19,949 INFO L226 Difference]: Without dead ends: 1095 [2021-12-15 21:59:19,952 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:19,953 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 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 [2021-12-15 21:59:19,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-12-15 21:59:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2021-12-15 21:59:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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) [2021-12-15 21:59:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2021-12-15 21:59:19,977 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2021-12-15 21:59:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:19,977 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2021-12-15 21:59:19,977 INFO L471 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) [2021-12-15 21:59:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2021-12-15 21:59:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 21:59:19,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:19,985 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:19,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 21:59:19,985 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2021-12-15 21:59:19,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:19,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974801146] [2021-12-15 21:59:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:19,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974801146] [2021-12-15 21:59:20,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974801146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976215131] [2021-12-15 21:59:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,029 INFO L87 Difference]: Start difference. First operand 837 states and 1387 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) [2021-12-15 21:59:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,048 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2021-12-15 21:59:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,048 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 [2021-12-15 21:59:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,052 INFO L225 Difference]: With dead ends: 1977 [2021-12-15 21:59:20,052 INFO L226 Difference]: Without dead ends: 1159 [2021-12-15 21:59:20,053 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,055 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 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 [2021-12-15 21:59:20,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-12-15 21:59:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2021-12-15 21:59:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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) [2021-12-15 21:59:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2021-12-15 21:59:20,075 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2021-12-15 21:59:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,077 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2021-12-15 21:59:20,077 INFO L471 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) [2021-12-15 21:59:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2021-12-15 21:59:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 21:59:20,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,078 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 21:59:20,079 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2021-12-15 21:59:20,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214652154] [2021-12-15 21:59:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214652154] [2021-12-15 21:59:20,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214652154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446803452] [2021-12-15 21:59:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,109 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 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) [2021-12-15 21:59:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,127 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2021-12-15 21:59:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,127 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 [2021-12-15 21:59:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,132 INFO L225 Difference]: With dead ends: 1737 [2021-12-15 21:59:20,132 INFO L226 Difference]: Without dead ends: 1175 [2021-12-15 21:59:20,133 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,133 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 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 [2021-12-15 21:59:20,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-12-15 21:59:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2021-12-15 21:59:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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) [2021-12-15 21:59:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2021-12-15 21:59:20,155 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2021-12-15 21:59:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,156 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2021-12-15 21:59:20,156 INFO L471 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) [2021-12-15 21:59:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2021-12-15 21:59:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 21:59:20,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,157 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 21:59:20,157 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2021-12-15 21:59:20,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646201383] [2021-12-15 21:59:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646201383] [2021-12-15 21:59:20,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646201383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536006677] [2021-12-15 21:59:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,191 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 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) [2021-12-15 21:59:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,226 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2021-12-15 21:59:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,227 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 [2021-12-15 21:59:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,232 INFO L225 Difference]: With dead ends: 2121 [2021-12-15 21:59:20,232 INFO L226 Difference]: Without dead ends: 2119 [2021-12-15 21:59:20,234 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,235 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 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 [2021-12-15 21:59:20,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-12-15 21:59:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2021-12-15 21:59:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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) [2021-12-15 21:59:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2021-12-15 21:59:20,266 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2021-12-15 21:59:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,266 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2021-12-15 21:59:20,266 INFO L471 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) [2021-12-15 21:59:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2021-12-15 21:59:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 21:59:20,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,268 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 21:59:20,268 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2021-12-15 21:59:20,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143874379] [2021-12-15 21:59:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143874379] [2021-12-15 21:59:20,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143874379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236424534] [2021-12-15 21:59:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,298 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 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) [2021-12-15 21:59:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,321 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2021-12-15 21:59:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,322 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 [2021-12-15 21:59:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,328 INFO L225 Difference]: With dead ends: 3913 [2021-12-15 21:59:20,328 INFO L226 Difference]: Without dead ends: 2279 [2021-12-15 21:59:20,330 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,331 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 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 [2021-12-15 21:59:20,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2021-12-15 21:59:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2021-12-15 21:59:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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) [2021-12-15 21:59:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2021-12-15 21:59:20,372 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2021-12-15 21:59:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,372 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2021-12-15 21:59:20,372 INFO L471 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) [2021-12-15 21:59:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2021-12-15 21:59:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 21:59:20,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,374 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 21:59:20,374 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2021-12-15 21:59:20,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753901569] [2021-12-15 21:59:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753901569] [2021-12-15 21:59:20,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753901569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491469159] [2021-12-15 21:59:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,403 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 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) [2021-12-15 21:59:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,424 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2021-12-15 21:59:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,425 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 [2021-12-15 21:59:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,431 INFO L225 Difference]: With dead ends: 3417 [2021-12-15 21:59:20,431 INFO L226 Difference]: Without dead ends: 2311 [2021-12-15 21:59:20,433 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,434 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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 [2021-12-15 21:59:20,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2021-12-15 21:59:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2021-12-15 21:59:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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) [2021-12-15 21:59:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2021-12-15 21:59:20,497 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2021-12-15 21:59:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,497 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2021-12-15 21:59:20,497 INFO L471 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) [2021-12-15 21:59:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2021-12-15 21:59:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 21:59:20,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,499 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 21:59:20,499 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2021-12-15 21:59:20,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460709648] [2021-12-15 21:59:20,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460709648] [2021-12-15 21:59:20,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460709648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766630977] [2021-12-15 21:59:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,514 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 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) [2021-12-15 21:59:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,540 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2021-12-15 21:59:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,541 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 [2021-12-15 21:59:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,551 INFO L225 Difference]: With dead ends: 4105 [2021-12-15 21:59:20,551 INFO L226 Difference]: Without dead ends: 4103 [2021-12-15 21:59:20,553 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,553 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 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 [2021-12-15 21:59:20,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2021-12-15 21:59:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2021-12-15 21:59:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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) [2021-12-15 21:59:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2021-12-15 21:59:20,608 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2021-12-15 21:59:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,608 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2021-12-15 21:59:20,608 INFO L471 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) [2021-12-15 21:59:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2021-12-15 21:59:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 21:59:20,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,611 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 21:59:20,611 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2021-12-15 21:59:20,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012130305] [2021-12-15 21:59:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012130305] [2021-12-15 21:59:20,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012130305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360538288] [2021-12-15 21:59:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,626 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 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) [2021-12-15 21:59:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,679 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2021-12-15 21:59:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,679 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 [2021-12-15 21:59:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,689 INFO L225 Difference]: With dead ends: 7753 [2021-12-15 21:59:20,690 INFO L226 Difference]: Without dead ends: 4487 [2021-12-15 21:59:20,693 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,694 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 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 [2021-12-15 21:59:20,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2021-12-15 21:59:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2021-12-15 21:59:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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) [2021-12-15 21:59:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2021-12-15 21:59:20,767 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2021-12-15 21:59:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,767 INFO L470 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2021-12-15 21:59:20,767 INFO L471 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) [2021-12-15 21:59:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2021-12-15 21:59:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:59:20,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,772 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 21:59:20,773 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2021-12-15 21:59:20,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071107961] [2021-12-15 21:59:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071107961] [2021-12-15 21:59:20,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071107961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282431360] [2021-12-15 21:59:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,797 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 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) [2021-12-15 21:59:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:20,851 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2021-12-15 21:59:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:20,852 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 [2021-12-15 21:59:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:20,872 INFO L225 Difference]: With dead ends: 6729 [2021-12-15 21:59:20,872 INFO L226 Difference]: Without dead ends: 4551 [2021-12-15 21:59:20,874 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:20,876 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 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 [2021-12-15 21:59:20,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2021-12-15 21:59:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2021-12-15 21:59:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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) [2021-12-15 21:59:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2021-12-15 21:59:20,957 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2021-12-15 21:59:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:20,958 INFO L470 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2021-12-15 21:59:20,958 INFO L471 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) [2021-12-15 21:59:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2021-12-15 21:59:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:59:20,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:20,962 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:20,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 21:59:20,962 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2021-12-15 21:59:20,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:20,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318976795] [2021-12-15 21:59:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:20,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:20,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:20,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318976795] [2021-12-15 21:59:20,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318976795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:20,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:20,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:20,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965437605] [2021-12-15 21:59:20,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:20,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:20,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:20,979 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 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) [2021-12-15 21:59:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:21,046 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2021-12-15 21:59:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:21,047 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 [2021-12-15 21:59:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:21,058 INFO L225 Difference]: With dead ends: 7945 [2021-12-15 21:59:21,058 INFO L226 Difference]: Without dead ends: 7943 [2021-12-15 21:59:21,060 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:21,061 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 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 [2021-12-15 21:59:21,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2021-12-15 21:59:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2021-12-15 21:59:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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) [2021-12-15 21:59:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2021-12-15 21:59:21,183 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2021-12-15 21:59:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:21,183 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2021-12-15 21:59:21,184 INFO L471 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) [2021-12-15 21:59:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2021-12-15 21:59:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:59:21,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:21,190 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:21,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 21:59:21,190 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:21,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2021-12-15 21:59:21,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:21,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953889316] [2021-12-15 21:59:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:21,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:21,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953889316] [2021-12-15 21:59:21,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953889316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:21,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:21,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:21,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882873682] [2021-12-15 21:59:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:21,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:21,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:21,222 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 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) [2021-12-15 21:59:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:21,324 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2021-12-15 21:59:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:21,324 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 [2021-12-15 21:59:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:21,336 INFO L225 Difference]: With dead ends: 15369 [2021-12-15 21:59:21,336 INFO L226 Difference]: Without dead ends: 8839 [2021-12-15 21:59:21,343 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:21,344 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 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 [2021-12-15 21:59:21,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2021-12-15 21:59:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2021-12-15 21:59:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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) [2021-12-15 21:59:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2021-12-15 21:59:21,530 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2021-12-15 21:59:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:21,530 INFO L470 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2021-12-15 21:59:21,531 INFO L471 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) [2021-12-15 21:59:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2021-12-15 21:59:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 21:59:21,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:21,539 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:21,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 21:59:21,539 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:21,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2021-12-15 21:59:21,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:21,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497600038] [2021-12-15 21:59:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:21,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497600038] [2021-12-15 21:59:21,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497600038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:21,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:21,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:21,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281847671] [2021-12-15 21:59:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:21,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:21,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:21,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:21,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:21,557 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 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) [2021-12-15 21:59:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:21,646 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2021-12-15 21:59:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:21,646 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 [2021-12-15 21:59:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:21,661 INFO L225 Difference]: With dead ends: 13257 [2021-12-15 21:59:21,661 INFO L226 Difference]: Without dead ends: 8967 [2021-12-15 21:59:21,669 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:21,670 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 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 [2021-12-15 21:59:21,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2021-12-15 21:59:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2021-12-15 21:59:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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) [2021-12-15 21:59:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2021-12-15 21:59:21,861 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2021-12-15 21:59:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:21,861 INFO L470 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2021-12-15 21:59:21,861 INFO L471 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) [2021-12-15 21:59:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2021-12-15 21:59:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 21:59:21,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:21,868 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:21,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-15 21:59:21,869 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2021-12-15 21:59:21,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:21,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422486112] [2021-12-15 21:59:21,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:21,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:21,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:21,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422486112] [2021-12-15 21:59:21,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422486112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:21,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:21,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:21,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992962562] [2021-12-15 21:59:21,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:21,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:21,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:21,893 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 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) [2021-12-15 21:59:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:22,051 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2021-12-15 21:59:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:22,052 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 [2021-12-15 21:59:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:22,073 INFO L225 Difference]: With dead ends: 15369 [2021-12-15 21:59:22,073 INFO L226 Difference]: Without dead ends: 15367 [2021-12-15 21:59:22,077 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:22,078 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 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 [2021-12-15 21:59:22,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2021-12-15 21:59:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2021-12-15 21:59:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13317 states, 13316 states have (on average 1.3555872634424753) internal successors, (18051), 13316 states have internal predecessors, (18051), 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) [2021-12-15 21:59:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2021-12-15 21:59:22,314 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2021-12-15 21:59:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:22,314 INFO L470 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2021-12-15 21:59:22,314 INFO L471 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) [2021-12-15 21:59:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2021-12-15 21:59:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 21:59:22,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:22,326 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:22,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-15 21:59:22,327 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2021-12-15 21:59:22,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:22,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422237179] [2021-12-15 21:59:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:22,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:22,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:22,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422237179] [2021-12-15 21:59:22,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422237179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:22,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:22,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:22,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422075001] [2021-12-15 21:59:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:22,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:22,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:22,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:22,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:22,402 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 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) [2021-12-15 21:59:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:22,538 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2021-12-15 21:59:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:22,538 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 [2021-12-15 21:59:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:22,564 INFO L225 Difference]: With dead ends: 30473 [2021-12-15 21:59:22,564 INFO L226 Difference]: Without dead ends: 17415 [2021-12-15 21:59:22,580 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:22,581 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 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 [2021-12-15 21:59:22,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2021-12-15 21:59:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2021-12-15 21:59:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3381001608086378) internal successors, (23299), 17412 states have internal predecessors, (23299), 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) [2021-12-15 21:59:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2021-12-15 21:59:22,882 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2021-12-15 21:59:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:22,882 INFO L470 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2021-12-15 21:59:22,882 INFO L471 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) [2021-12-15 21:59:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2021-12-15 21:59:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 21:59:22,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:22,895 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:22,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-15 21:59:22,895 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2021-12-15 21:59:22,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:22,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143860222] [2021-12-15 21:59:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:22,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:22,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:22,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143860222] [2021-12-15 21:59:22,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143860222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:22,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:22,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:22,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649515747] [2021-12-15 21:59:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:22,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:22,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:22,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:22,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:22,914 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 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) [2021-12-15 21:59:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:23,025 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2021-12-15 21:59:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:23,026 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 [2021-12-15 21:59:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:23,051 INFO L225 Difference]: With dead ends: 26121 [2021-12-15 21:59:23,052 INFO L226 Difference]: Without dead ends: 17671 [2021-12-15 21:59:23,062 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:23,063 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 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 [2021-12-15 21:59:23,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2021-12-15 21:59:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2021-12-15 21:59:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17668 states have (on average 1.318711795336201) internal successors, (23299), 17668 states have internal predecessors, (23299), 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) [2021-12-15 21:59:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2021-12-15 21:59:23,427 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2021-12-15 21:59:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:23,428 INFO L470 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2021-12-15 21:59:23,428 INFO L471 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) [2021-12-15 21:59:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2021-12-15 21:59:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 21:59:23,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:23,442 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:23,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-15 21:59:23,442 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2021-12-15 21:59:23,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105071250] [2021-12-15 21:59:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:23,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:23,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:23,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105071250] [2021-12-15 21:59:23,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105071250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:23,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:23,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:23,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51241524] [2021-12-15 21:59:23,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:23,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:23,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:23,457 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 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) [2021-12-15 21:59:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:23,629 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2021-12-15 21:59:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:23,629 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 [2021-12-15 21:59:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:23,680 INFO L225 Difference]: With dead ends: 29705 [2021-12-15 21:59:23,680 INFO L226 Difference]: Without dead ends: 29703 [2021-12-15 21:59:23,690 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:23,690 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 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 [2021-12-15 21:59:23,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2021-12-15 21:59:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2021-12-15 21:59:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 1.2787667117320114) internal successors, (34051), 26628 states have internal predecessors, (34051), 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) [2021-12-15 21:59:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2021-12-15 21:59:24,111 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2021-12-15 21:59:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:24,111 INFO L470 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2021-12-15 21:59:24,111 INFO L471 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) [2021-12-15 21:59:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2021-12-15 21:59:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 21:59:24,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:24,136 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:24,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-15 21:59:24,137 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2021-12-15 21:59:24,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:24,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768124236] [2021-12-15 21:59:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:24,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:24,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:24,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768124236] [2021-12-15 21:59:24,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768124236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:24,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:24,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:24,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517692241] [2021-12-15 21:59:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:24,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:24,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:24,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:24,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:24,152 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 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) [2021-12-15 21:59:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:24,438 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2021-12-15 21:59:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:24,439 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 [2021-12-15 21:59:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:24,489 INFO L225 Difference]: With dead ends: 60425 [2021-12-15 21:59:24,489 INFO L226 Difference]: Without dead ends: 34311 [2021-12-15 21:59:24,510 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:24,511 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 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 [2021-12-15 21:59:24,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2021-12-15 21:59:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2021-12-15 21:59:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34309 states, 34308 states have (on average 1.2536726128016789) internal successors, (43011), 34308 states have internal predecessors, (43011), 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) [2021-12-15 21:59:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2021-12-15 21:59:24,970 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2021-12-15 21:59:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:24,970 INFO L470 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2021-12-15 21:59:24,970 INFO L471 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) [2021-12-15 21:59:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2021-12-15 21:59:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:59:24,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:24,989 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:24,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-15 21:59:24,990 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2021-12-15 21:59:24,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:24,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422720545] [2021-12-15 21:59:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:24,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:25,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:25,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422720545] [2021-12-15 21:59:25,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422720545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:25,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:25,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:25,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067595358] [2021-12-15 21:59:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:25,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:25,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:25,005 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 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) [2021-12-15 21:59:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:25,286 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2021-12-15 21:59:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:25,286 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 [2021-12-15 21:59:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:25,325 INFO L225 Difference]: With dead ends: 51465 [2021-12-15 21:59:25,325 INFO L226 Difference]: Without dead ends: 34823 [2021-12-15 21:59:25,338 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:25,339 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 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 [2021-12-15 21:59:25,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2021-12-15 21:59:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2021-12-15 21:59:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.23523836875359) internal successors, (43011), 34820 states have internal predecessors, (43011), 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) [2021-12-15 21:59:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2021-12-15 21:59:25,897 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2021-12-15 21:59:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:25,898 INFO L470 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2021-12-15 21:59:25,898 INFO L471 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) [2021-12-15 21:59:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2021-12-15 21:59:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:59:25,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:25,917 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:25,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-15 21:59:25,917 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2021-12-15 21:59:25,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:25,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358617447] [2021-12-15 21:59:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:25,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:25,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:25,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358617447] [2021-12-15 21:59:25,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358617447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:25,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:25,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:25,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223910535] [2021-12-15 21:59:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:25,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:25,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:25,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:25,932 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 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) [2021-12-15 21:59:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:26,369 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2021-12-15 21:59:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:26,369 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 [2021-12-15 21:59:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:26,464 INFO L225 Difference]: With dead ends: 101385 [2021-12-15 21:59:26,464 INFO L226 Difference]: Without dead ends: 67591 [2021-12-15 21:59:26,681 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:26,681 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 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 [2021-12-15 21:59:26,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2021-12-15 21:59:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2021-12-15 21:59:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.1817926259099247) internal successors, (79875), 67588 states have internal predecessors, (79875), 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) [2021-12-15 21:59:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2021-12-15 21:59:27,612 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2021-12-15 21:59:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:27,612 INFO L470 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2021-12-15 21:59:27,612 INFO L471 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) [2021-12-15 21:59:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2021-12-15 21:59:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:59:27,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:27,651 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:27,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-15 21:59:27,651 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2021-12-15 21:59:27,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:27,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390456617] [2021-12-15 21:59:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:27,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:27,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:27,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390456617] [2021-12-15 21:59:27,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390456617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:27,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:27,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:27,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898038558] [2021-12-15 21:59:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:27,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:27,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:27,669 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 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) [2021-12-15 21:59:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:28,355 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2021-12-15 21:59:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:28,356 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 [2021-12-15 21:59:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:28,465 INFO L225 Difference]: With dead ends: 71689 [2021-12-15 21:59:28,465 INFO L226 Difference]: Without dead ends: 71687 [2021-12-15 21:59:28,485 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:28,486 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 166 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 [2021-12-15 21:59:28,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2021-12-15 21:59:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2021-12-15 21:59:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.166642007456945) internal successors, (78851), 67588 states have internal predecessors, (78851), 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) [2021-12-15 21:59:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2021-12-15 21:59:29,493 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2021-12-15 21:59:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:29,493 INFO L470 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2021-12-15 21:59:29,493 INFO L471 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) [2021-12-15 21:59:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2021-12-15 21:59:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 21:59:29,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:29,528 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:29,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-15 21:59:29,528 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2021-12-15 21:59:29,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:29,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696371688] [2021-12-15 21:59:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:29,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:29,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:29,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696371688] [2021-12-15 21:59:29,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696371688] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:29,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:29,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:29,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607944914] [2021-12-15 21:59:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:29,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:29,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:29,542 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 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) [2021-12-15 21:59:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:30,343 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2021-12-15 21:59:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:30,344 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 [2021-12-15 21:59:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:30,497 INFO L225 Difference]: With dead ends: 109575 [2021-12-15 21:59:30,497 INFO L226 Difference]: Without dead ends: 109573 [2021-12-15 21:59:30,520 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:30,521 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 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 [2021-12-15 21:59:30,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2021-12-15 21:59:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2021-12-15 21:59:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105477 states, 105476 states have (on average 1.1456160643179492) internal successors, (120835), 105476 states have internal predecessors, (120835), 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) [2021-12-15 21:59:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2021-12-15 21:59:32,073 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2021-12-15 21:59:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:32,074 INFO L470 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2021-12-15 21:59:32,074 INFO L471 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) [2021-12-15 21:59:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2021-12-15 21:59:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 21:59:32,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:59:32,137 INFO L514 BasicCegarLoop]: 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] [2021-12-15 21:59:32,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-15 21:59:32,138 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:59:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:59:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2021-12-15 21:59:32,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:59:32,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877105620] [2021-12-15 21:59:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:59:32,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:59:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:59:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:59:32,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:59:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877105620] [2021-12-15 21:59:32,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877105620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:59:32,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:59:32,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:59:32,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952349533] [2021-12-15 21:59:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:59:32,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:59:32,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:59:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:59:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:59:32,152 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 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) [2021-12-15 21:59:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:59:33,395 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2021-12-15 21:59:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:59:33,395 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 [2021-12-15 21:59:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:59:33,396 INFO L225 Difference]: With dead ends: 236549 [2021-12-15 21:59:33,396 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 21:59:33,476 INFO L932 BasicCegarLoop]: 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 [2021-12-15 21:59:33,477 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 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 [2021-12-15 21:59:33,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:59:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 21:59:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 21:59:33,478 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) [2021-12-15 21:59:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 21:59:33,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-12-15 21:59:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:59:33,478 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 21:59:33,479 INFO L471 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) [2021-12-15 21:59:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 21:59:33,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 21:59:33,481 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 21:59:33,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-15 21:59:33,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 21:59:33,501 INFO L858 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2021-12-15 21:59:33,501 INFO L854 garLoopResultBuilder]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2021-12-15 21:59:33,502 INFO L858 garLoopResultBuilder]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L861 garLoopResultBuilder]: At program point L189(lines 7 193) the Hoare annotation is: true [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L174(line 174) no Hoare annotation was computed. [2021-12-15 21:59:33,503 INFO L858 garLoopResultBuilder]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L861 garLoopResultBuilder]: At program point L192(lines 6 193) the Hoare annotation is: true [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L159(line 159) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2021-12-15 21:59:33,504 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,505 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2021-12-15 21:59:33,506 INFO L861 garLoopResultBuilder]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2021-12-15 21:59:33,506 INFO L858 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2021-12-15 21:59:33,514 INFO L732 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] [2021-12-15 21:59:33,516 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 21:59:33,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:59:33 BoogieIcfgContainer [2021-12-15 21:59:33,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 21:59:33,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 21:59:33,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 21:59:33,528 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 21:59:33,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:59:18" (3/4) ... [2021-12-15 21:59:33,533 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-15 21:59:33,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-15 21:59:33,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-15 21:59:33,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-15 21:59:33,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-15 21:59:33,581 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 21:59:33,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 21:59:33,582 INFO L158 Benchmark]: Toolchain (without parser) took 15362.53ms. Allocated memory was 94.4MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 60.9MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-12-15 21:59:33,582 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 94.4MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:59:33,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.70ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 60.7MB in the beginning and 96.1MB in the end (delta: -35.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 21:59:33,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.08ms. Allocated memory is still 121.6MB. Free memory was 96.1MB in the beginning and 94.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:59:33,588 INFO L158 Benchmark]: Boogie Preprocessor took 36.61ms. Allocated memory is still 121.6MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 21:59:33,588 INFO L158 Benchmark]: RCFGBuilder took 227.09ms. Allocated memory is still 121.6MB. Free memory was 93.0MB in the beginning and 79.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 21:59:33,588 INFO L158 Benchmark]: TraceAbstraction took 14791.98ms. Allocated memory was 121.6MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 79.3MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-12-15 21:59:33,588 INFO L158 Benchmark]: Witness Printer took 53.91ms. Allocated memory is still 11.1GB. Free memory was 9.8GB in the beginning and 9.8GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-15 21:59:33,591 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.11ms. Allocated memory is still 94.4MB. Free memory was 51.7MB in the beginning and 51.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.70ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 60.7MB in the beginning and 96.1MB in the end (delta: -35.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.08ms. Allocated memory is still 121.6MB. Free memory was 96.1MB in the beginning and 94.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.61ms. Allocated memory is still 121.6MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 227.09ms. Allocated memory is still 121.6MB. Free memory was 93.0MB in the beginning and 79.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14791.98ms. Allocated memory was 121.6MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 79.3MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 53.91ms. Allocated memory is still 11.1GB. Free memory was 9.8GB in the beginning and 9.8GB 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: 191]: 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1629 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1629 mSDsluCounter, 5405 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2174 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3231 mSDtfsCounter, 175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 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.6s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 1702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-15 21:59:33,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE