./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 9165506a5cbed6d9b33897b744e7410ef8890a41 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-03 12:07:54,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-03 12:07:54,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-03 12:07:54,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-03 12:07:54,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-03 12:07:54,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-03 12:07:54,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-03 12:07:54,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-03 12:07:54,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-03 12:07:54,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-03 12:07:54,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-03 12:07:54,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-03 12:07:54,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-03 12:07:54,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-03 12:07:54,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-03 12:07:54,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-03 12:07:54,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-03 12:07:54,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-03 12:07:54,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-03 12:07:54,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-03 12:07:54,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-03 12:07:54,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-03 12:07:54,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-03 12:07:54,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-03 12:07:54,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-03 12:07:54,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-03 12:07:54,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-03 12:07:54,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-03 12:07:54,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-03 12:07:54,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-03 12:07:54,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-03 12:07:54,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-03 12:07:54,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-03 12:07:54,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-03 12:07:54,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-03 12:07:54,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-03 12:07:54,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-03 12:07:54,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-03 12:07:54,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-03 12:07:54,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-03 12:07:54,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-03 12:07:54,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-03 12:07:54,736 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-03 12:07:54,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-03 12:07:54,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-03 12:07:54,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-03 12:07:54,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-03 12:07:54,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-03 12:07:54,740 INFO L138 SettingsManager]: * Use SBE=true [2021-10-03 12:07:54,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-03 12:07:54,741 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-03 12:07:54,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-03 12:07:54,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-03 12:07:54,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-03 12:07:54,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-03 12:07:54,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-03 12:07:54,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-03 12:07:54,743 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-03 12:07:54,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-03 12:07:54,744 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-03 12:07:54,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-03 12:07:54,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-03 12:07:54,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-03 12:07:54,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-03 12:07:54,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 12:07:54,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-03 12:07:54,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-03 12:07:54,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-03 12:07:54,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-03 12:07:54,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-03 12:07:54,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-03 12:07:54,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-03 12:07:54,747 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-2/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-2/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 -> 9165506a5cbed6d9b33897b744e7410ef8890a41 [2021-10-03 12:07:55,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-03 12:07:55,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-03 12:07:55,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-03 12:07:55,199 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-03 12:07:55,200 INFO L275 PluginConnector]: CDTParser initialized [2021-10-03 12:07:55,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-03 12:07:55,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59092791a/cea3464ec344433b9fcc5231c90f45f6/FLAG186a99b45 [2021-10-03 12:07:55,991 INFO L306 CDTParser]: Found 1 translation units. [2021-10-03 12:07:55,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c [2021-10-03 12:07:55,993 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 12:07:55,993 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 12:07:56,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59092791a/cea3464ec344433b9fcc5231c90f45f6/FLAG186a99b45 [2021-10-03 12:07:56,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59092791a/cea3464ec344433b9fcc5231c90f45f6 [2021-10-03 12:07:56,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-03 12:07:56,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-03 12:07:56,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-03 12:07:56,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-03 12:07:56,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-03 12:07:56,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407e0cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56, skipping insertion in model container [2021-10-03 12:07:56,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-03 12:07:56,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-03 12:07:56,542 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 12:07:56,603 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c[1513,1526] [2021-10-03 12:07:56,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 12:07:56,618 INFO L203 MainTranslator]: Completed pre-run [2021-10-03 12:07:56,628 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 12:07:56,643 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-3.wvr.c[1513,1526] [2021-10-03 12:07:56,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 12:07:56,668 INFO L208 MainTranslator]: Completed translation [2021-10-03 12:07:56,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56 WrapperNode [2021-10-03 12:07:56,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-03 12:07:56,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-03 12:07:56,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-03 12:07:56,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-03 12:07:56,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-03 12:07:56,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-03 12:07:56,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-03 12:07:56,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-03 12:07:56,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-03 12:07:56,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-03 12:07:56,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-03 12:07:56,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-03 12:07:56,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (1/1) ... [2021-10-03 12:07:56,851 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 12:07:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 12:07:56,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-03 12:07:56,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-03 12:07:56,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-03 12:07:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-03 12:07:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-03 12:07:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-03 12:07:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-03 12:07:56,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-03 12:07:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-03 12:07:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-03 12:07:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-03 12:07:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-03 12:07:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-03 12:07:56,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-03 12:07:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-03 12:07:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-03 12:07:56,978 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-03 12:07:57,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-03 12:07:57,467 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-10-03 12:07:57,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:07:57 BoogieIcfgContainer [2021-10-03 12:07:57,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-03 12:07:57,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-03 12:07:57,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-03 12:07:57,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-03 12:07:57,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 12:07:56" (1/3) ... [2021-10-03 12:07:57,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ebf54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:07:57, skipping insertion in model container [2021-10-03 12:07:57,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:07:56" (2/3) ... [2021-10-03 12:07:57,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ebf54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:07:57, skipping insertion in model container [2021-10-03 12:07:57,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:07:57" (3/3) ... [2021-10-03 12:07:57,480 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-3.wvr.c [2021-10-03 12:07:57,487 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-03 12:07:57,488 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-03 12:07:57,488 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-03 12:07:57,488 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-03 12:07:57,533 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,533 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,534 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,534 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,535 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,535 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,535 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,535 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,536 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,536 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,536 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,537 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,537 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,537 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,538 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,538 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,538 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,539 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,539 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,539 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,540 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,540 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,540 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,541 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,541 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,542 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,542 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,542 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,543 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,543 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,543 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,543 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,545 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,545 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,548 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,548 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,548 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,549 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,549 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,550 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,550 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,550 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,550 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,551 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,551 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,551 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,552 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,552 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,552 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,552 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,553 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,553 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,553 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,554 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,554 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,554 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,555 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,555 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,555 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,556 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,556 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,560 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,560 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,561 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,561 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,561 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,562 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,564 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,565 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,565 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,565 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,566 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,566 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,568 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,569 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,569 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,569 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,570 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,570 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:07:57,584 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-03 12:07:57,639 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-03 12:07:57,649 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, mConcurrency=FINITE_AUTOMATA, 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-10-03 12:07:57,650 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-03 12:07:57,681 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-03 12:07:57,694 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 125 transitions, 274 flow [2021-10-03 12:07:57,698 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 125 transitions, 274 flow [2021-10-03 12:07:57,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 125 transitions, 274 flow [2021-10-03 12:07:57,832 INFO L129 PetriNetUnfolder]: 5/122 cut-off events. [2021-10-03 12:07:57,837 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-03 12:07:57,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 5/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-10-03 12:07:57,855 INFO L116 LiptonReduction]: Number of co-enabled transitions 2032 [2021-10-03 12:08:01,776 INFO L131 LiptonReduction]: Checked pairs total: 5807 [2021-10-03 12:08:01,777 INFO L133 LiptonReduction]: Total number of compositions: 104 [2021-10-03 12:08:01,788 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 92 flow [2021-10-03 12:08:01,846 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 689 states have (on average 3.0537010159651667) internal successors, (2104), 689 states have internal predecessors, (2104), 0 states have call successors, (0), 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-10-03 12:08:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 689 states have (on average 3.0537010159651667) internal successors, (2104), 689 states have internal predecessors, (2104), 0 states have call successors, (0), 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-10-03 12:08:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-03 12:08:01,876 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:01,877 INFO L512 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-10-03 12:08:01,878 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash 116229821, now seen corresponding path program 1 times [2021-10-03 12:08:01,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:01,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468495789] [2021-10-03 12:08:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:01,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:02,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:02,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468495789] [2021-10-03 12:08:02,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468495789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:02,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:02,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-03 12:08:02,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330322470] [2021-10-03 12:08:02,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-03 12:08:02,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-03 12:08:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-03 12:08:02,116 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 3.0537010159651667) internal successors, (2104), 689 states have internal predecessors, (2104), 0 states have call successors, (0), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-10-03 12:08:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:02,156 INFO L93 Difference]: Finished difference Result 690 states and 1994 transitions. [2021-10-03 12:08:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-03 12:08:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-10-03 12:08:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:02,188 INFO L225 Difference]: With dead ends: 690 [2021-10-03 12:08:02,188 INFO L226 Difference]: Without dead ends: 690 [2021-10-03 12:08:02,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-03 12:08:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-03 12:08:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2021-10-03 12:08:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.8940493468795356) internal successors, (1994), 689 states have internal predecessors, (1994), 0 states have call successors, (0), 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-10-03 12:08:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1994 transitions. [2021-10-03 12:08:02,340 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1994 transitions. Word has length 25 [2021-10-03 12:08:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:02,341 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1994 transitions. [2021-10-03 12:08:02,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-10-03 12:08:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1994 transitions. [2021-10-03 12:08:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:02,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:02,353 INFO L512 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-10-03 12:08:02,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-03 12:08:02,354 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 702917772, now seen corresponding path program 1 times [2021-10-03 12:08:02,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:02,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985296761] [2021-10-03 12:08:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:02,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:02,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:02,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985296761] [2021-10-03 12:08:02,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985296761] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:02,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:02,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-03 12:08:02,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983276582] [2021-10-03 12:08:02,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 12:08:02,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 12:08:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-03 12:08:02,848 INFO L87 Difference]: Start difference. First operand 690 states and 1994 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-10-03 12:08:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:03,124 INFO L93 Difference]: Finished difference Result 1135 states and 3256 transitions. [2021-10-03 12:08:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:03,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-10-03 12:08:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:03,134 INFO L225 Difference]: With dead ends: 1135 [2021-10-03 12:08:03,135 INFO L226 Difference]: Without dead ends: 842 [2021-10-03 12:08:03,136 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.4ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-10-03 12:08:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 836. [2021-10-03 12:08:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 2.875449101796407) internal successors, (2401), 835 states have internal predecessors, (2401), 0 states have call successors, (0), 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-10-03 12:08:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2401 transitions. [2021-10-03 12:08:03,180 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2401 transitions. Word has length 29 [2021-10-03 12:08:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:03,181 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 2401 transitions. [2021-10-03 12:08:03,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-10-03 12:08:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2401 transitions. [2021-10-03 12:08:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:03,186 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:03,186 INFO L512 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-10-03 12:08:03,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-03 12:08:03,187 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash 909556812, now seen corresponding path program 2 times [2021-10-03 12:08:03,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:03,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097202109] [2021-10-03 12:08:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:03,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:03,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:03,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097202109] [2021-10-03 12:08:03,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097202109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:03,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:03,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:03,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925014899] [2021-10-03 12:08:03,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:03,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:03,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:03,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:03,410 INFO L87 Difference]: Start difference. First operand 836 states and 2401 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:03,668 INFO L93 Difference]: Finished difference Result 884 states and 2490 transitions. [2021-10-03 12:08:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 12:08:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:03,677 INFO L225 Difference]: With dead ends: 884 [2021-10-03 12:08:03,677 INFO L226 Difference]: Without dead ends: 884 [2021-10-03 12:08:03,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 114.3ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:08:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-03 12:08:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 836. [2021-10-03 12:08:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 2.8095808383233534) internal successors, (2346), 835 states have internal predecessors, (2346), 0 states have call successors, (0), 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-10-03 12:08:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2346 transitions. [2021-10-03 12:08:03,715 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2346 transitions. Word has length 29 [2021-10-03 12:08:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:03,715 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 2346 transitions. [2021-10-03 12:08:03,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2346 transitions. [2021-10-03 12:08:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:03,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:03,720 INFO L512 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-10-03 12:08:03,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-03 12:08:03,721 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1733412496, now seen corresponding path program 3 times [2021-10-03 12:08:03,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:03,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216314402] [2021-10-03 12:08:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:03,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:03,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:03,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216314402] [2021-10-03 12:08:03,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216314402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:03,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:03,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:03,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762298029] [2021-10-03 12:08:03,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:03,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:03,871 INFO L87 Difference]: Start difference. First operand 836 states and 2346 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:04,175 INFO L93 Difference]: Finished difference Result 982 states and 2737 transitions. [2021-10-03 12:08:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-03 12:08:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:04,184 INFO L225 Difference]: With dead ends: 982 [2021-10-03 12:08:04,184 INFO L226 Difference]: Without dead ends: 908 [2021-10-03 12:08:04,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 136.1ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:08:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-10-03 12:08:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 860. [2021-10-03 12:08:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 2.80093131548312) internal successors, (2406), 859 states have internal predecessors, (2406), 0 states have call successors, (0), 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-10-03 12:08:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2406 transitions. [2021-10-03 12:08:04,222 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2406 transitions. Word has length 29 [2021-10-03 12:08:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:04,223 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 2406 transitions. [2021-10-03 12:08:04,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2406 transitions. [2021-10-03 12:08:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:04,228 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:04,228 INFO L512 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-10-03 12:08:04,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-03 12:08:04,229 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 337470370, now seen corresponding path program 4 times [2021-10-03 12:08:04,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:04,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124178307] [2021-10-03 12:08:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:04,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:04,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:04,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124178307] [2021-10-03 12:08:04,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124178307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:04,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:04,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:04,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478425004] [2021-10-03 12:08:04,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:04,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:04,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:04,456 INFO L87 Difference]: Start difference. First operand 860 states and 2406 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:04,879 INFO L93 Difference]: Finished difference Result 806 states and 1997 transitions. [2021-10-03 12:08:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-03 12:08:04,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:04,885 INFO L225 Difference]: With dead ends: 806 [2021-10-03 12:08:04,885 INFO L226 Difference]: Without dead ends: 686 [2021-10-03 12:08:04,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 189.9ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:08:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-03 12:08:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 646. [2021-10-03 12:08:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 2.510077519379845) internal successors, (1619), 645 states have internal predecessors, (1619), 0 states have call successors, (0), 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-10-03 12:08:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1619 transitions. [2021-10-03 12:08:04,909 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1619 transitions. Word has length 29 [2021-10-03 12:08:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:04,910 INFO L470 AbstractCegarLoop]: Abstraction has 646 states and 1619 transitions. [2021-10-03 12:08:04,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1619 transitions. [2021-10-03 12:08:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:04,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:04,913 INFO L512 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-10-03 12:08:04,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-03 12:08:04,914 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:04,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1980719474, now seen corresponding path program 5 times [2021-10-03 12:08:04,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:04,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176150722] [2021-10-03 12:08:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:04,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:05,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:05,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176150722] [2021-10-03 12:08:05,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176150722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:05,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:05,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:05,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401601882] [2021-10-03 12:08:05,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:05,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:05,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:05,069 INFO L87 Difference]: Start difference. First operand 646 states and 1619 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:05,411 INFO L93 Difference]: Finished difference Result 794 states and 1910 transitions. [2021-10-03 12:08:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:05,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:05,418 INFO L225 Difference]: With dead ends: 794 [2021-10-03 12:08:05,418 INFO L226 Difference]: Without dead ends: 766 [2021-10-03 12:08:05,419 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 137.2ms TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-10-03 12:08:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2021-10-03 12:08:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 650. [2021-10-03 12:08:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 2.5038520801232664) internal successors, (1625), 649 states have internal predecessors, (1625), 0 states have call successors, (0), 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-10-03 12:08:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1625 transitions. [2021-10-03 12:08:05,445 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1625 transitions. Word has length 29 [2021-10-03 12:08:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:05,446 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 1625 transitions. [2021-10-03 12:08:05,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1625 transitions. [2021-10-03 12:08:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:05,449 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:05,449 INFO L512 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-10-03 12:08:05,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-03 12:08:05,450 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1901023074, now seen corresponding path program 6 times [2021-10-03 12:08:05,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:05,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685582386] [2021-10-03 12:08:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:05,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:05,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:05,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685582386] [2021-10-03 12:08:05,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685582386] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:05,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:05,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:05,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595812689] [2021-10-03 12:08:05,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:05,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:05,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:05,592 INFO L87 Difference]: Start difference. First operand 650 states and 1625 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:05,990 INFO L93 Difference]: Finished difference Result 762 states and 1851 transitions. [2021-10-03 12:08:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-03 12:08:05,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:05,997 INFO L225 Difference]: With dead ends: 762 [2021-10-03 12:08:05,997 INFO L226 Difference]: Without dead ends: 730 [2021-10-03 12:08:05,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 185.7ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:08:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-10-03 12:08:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 642. [2021-10-03 12:08:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 2.5070202808112323) internal successors, (1607), 641 states have internal predecessors, (1607), 0 states have call successors, (0), 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-10-03 12:08:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1607 transitions. [2021-10-03 12:08:06,020 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1607 transitions. Word has length 29 [2021-10-03 12:08:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:06,021 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 1607 transitions. [2021-10-03 12:08:06,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1607 transitions. [2021-10-03 12:08:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:06,023 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:06,024 INFO L512 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-10-03 12:08:06,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-03 12:08:06,024 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1466629378, now seen corresponding path program 7 times [2021-10-03 12:08:06,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:06,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988068665] [2021-10-03 12:08:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:06,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:06,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:06,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988068665] [2021-10-03 12:08:06,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988068665] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:06,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:06,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:06,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240862292] [2021-10-03 12:08:06,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:06,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:06,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:06,126 INFO L87 Difference]: Start difference. First operand 642 states and 1607 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:06,318 INFO L93 Difference]: Finished difference Result 758 states and 1846 transitions. [2021-10-03 12:08:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:06,324 INFO L225 Difference]: With dead ends: 758 [2021-10-03 12:08:06,324 INFO L226 Difference]: Without dead ends: 740 [2021-10-03 12:08:06,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-03 12:08:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-03 12:08:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 690. [2021-10-03 12:08:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.4876632801161103) internal successors, (1714), 689 states have internal predecessors, (1714), 0 states have call successors, (0), 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-10-03 12:08:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1714 transitions. [2021-10-03 12:08:06,349 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1714 transitions. Word has length 29 [2021-10-03 12:08:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:06,349 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1714 transitions. [2021-10-03 12:08:06,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1714 transitions. [2021-10-03 12:08:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:06,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:06,352 INFO L512 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-10-03 12:08:06,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-03 12:08:06,352 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash 556780146, now seen corresponding path program 8 times [2021-10-03 12:08:06,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:06,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061019157] [2021-10-03 12:08:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:06,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:06,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:06,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061019157] [2021-10-03 12:08:06,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061019157] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:06,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:06,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:06,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280780952] [2021-10-03 12:08:06,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:06,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:06,479 INFO L87 Difference]: Start difference. First operand 690 states and 1714 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:06,782 INFO L93 Difference]: Finished difference Result 818 states and 1960 transitions. [2021-10-03 12:08:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:08:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:06,794 INFO L225 Difference]: With dead ends: 818 [2021-10-03 12:08:06,795 INFO L226 Difference]: Without dead ends: 798 [2021-10-03 12:08:06,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 127.2ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:08:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-10-03 12:08:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 696. [2021-10-03 12:08:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.4805755395683455) internal successors, (1724), 695 states have internal predecessors, (1724), 0 states have call successors, (0), 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-10-03 12:08:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1724 transitions. [2021-10-03 12:08:06,820 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1724 transitions. Word has length 29 [2021-10-03 12:08:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:06,821 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1724 transitions. [2021-10-03 12:08:06,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1724 transitions. [2021-10-03 12:08:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:06,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:06,824 INFO L512 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-10-03 12:08:06,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-03 12:08:06,824 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 801094206, now seen corresponding path program 9 times [2021-10-03 12:08:06,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:06,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485729958] [2021-10-03 12:08:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:06,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:06,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:06,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485729958] [2021-10-03 12:08:06,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485729958] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:06,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:06,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:06,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346362377] [2021-10-03 12:08:06,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:06,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:06,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:06,929 INFO L87 Difference]: Start difference. First operand 696 states and 1724 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:07,154 INFO L93 Difference]: Finished difference Result 802 states and 1940 transitions. [2021-10-03 12:08:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:07,161 INFO L225 Difference]: With dead ends: 802 [2021-10-03 12:08:07,161 INFO L226 Difference]: Without dead ends: 782 [2021-10-03 12:08:07,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 87.2ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:08:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2021-10-03 12:08:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 688. [2021-10-03 12:08:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.483260553129549) internal successors, (1706), 687 states have internal predecessors, (1706), 0 states have call successors, (0), 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-10-03 12:08:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1706 transitions. [2021-10-03 12:08:07,184 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1706 transitions. Word has length 29 [2021-10-03 12:08:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:07,184 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1706 transitions. [2021-10-03 12:08:07,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1706 transitions. [2021-10-03 12:08:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:07,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:07,188 INFO L512 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-10-03 12:08:07,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-03 12:08:07,188 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 281905278, now seen corresponding path program 10 times [2021-10-03 12:08:07,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:07,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784168026] [2021-10-03 12:08:07,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:07,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:07,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:07,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784168026] [2021-10-03 12:08:07,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784168026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:07,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:07,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:07,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477605215] [2021-10-03 12:08:07,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:07,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:07,284 INFO L87 Difference]: Start difference. First operand 688 states and 1706 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:07,512 INFO L93 Difference]: Finished difference Result 814 states and 1948 transitions. [2021-10-03 12:08:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:08:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:07,523 INFO L225 Difference]: With dead ends: 814 [2021-10-03 12:08:07,523 INFO L226 Difference]: Without dead ends: 802 [2021-10-03 12:08:07,524 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 79.8ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-10-03 12:08:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 688. [2021-10-03 12:08:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.480349344978166) internal successors, (1704), 687 states have internal predecessors, (1704), 0 states have call successors, (0), 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-10-03 12:08:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1704 transitions. [2021-10-03 12:08:07,549 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1704 transitions. Word has length 29 [2021-10-03 12:08:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:07,549 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1704 transitions. [2021-10-03 12:08:07,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1704 transitions. [2021-10-03 12:08:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:07,552 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:07,552 INFO L512 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-10-03 12:08:07,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-03 12:08:07,553 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -42105182, now seen corresponding path program 11 times [2021-10-03 12:08:07,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:07,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921702295] [2021-10-03 12:08:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:07,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:07,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:07,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921702295] [2021-10-03 12:08:07,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921702295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:07,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:07,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:07,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263779710] [2021-10-03 12:08:07,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:07,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:07,671 INFO L87 Difference]: Start difference. First operand 688 states and 1704 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:07,879 INFO L93 Difference]: Finished difference Result 808 states and 1933 transitions. [2021-10-03 12:08:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:08:07,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:07,885 INFO L225 Difference]: With dead ends: 808 [2021-10-03 12:08:07,885 INFO L226 Difference]: Without dead ends: 794 [2021-10-03 12:08:07,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2021-10-03 12:08:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 686. [2021-10-03 12:08:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 2.4802919708029196) internal successors, (1699), 685 states have internal predecessors, (1699), 0 states have call successors, (0), 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-10-03 12:08:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1699 transitions. [2021-10-03 12:08:07,908 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1699 transitions. Word has length 29 [2021-10-03 12:08:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:07,909 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1699 transitions. [2021-10-03 12:08:07,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1699 transitions. [2021-10-03 12:08:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:07,911 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:07,911 INFO L512 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-10-03 12:08:07,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-03 12:08:07,912 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash -734293454, now seen corresponding path program 12 times [2021-10-03 12:08:07,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:07,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29397465] [2021-10-03 12:08:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:07,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:08,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:08,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29397465] [2021-10-03 12:08:08,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29397465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:08,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:08,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:08,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378128452] [2021-10-03 12:08:08,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:08,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:08,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:08,034 INFO L87 Difference]: Start difference. First operand 686 states and 1699 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:08,368 INFO L93 Difference]: Finished difference Result 834 states and 2007 transitions. [2021-10-03 12:08:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:08,375 INFO L225 Difference]: With dead ends: 834 [2021-10-03 12:08:08,375 INFO L226 Difference]: Without dead ends: 822 [2021-10-03 12:08:08,375 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 153.3ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:08:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-10-03 12:08:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 682. [2021-10-03 12:08:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 2.4801762114537445) internal successors, (1689), 681 states have internal predecessors, (1689), 0 states have call successors, (0), 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-10-03 12:08:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1689 transitions. [2021-10-03 12:08:08,398 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1689 transitions. Word has length 29 [2021-10-03 12:08:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:08,399 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 1689 transitions. [2021-10-03 12:08:08,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1689 transitions. [2021-10-03 12:08:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:08,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:08,401 INFO L512 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-10-03 12:08:08,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-03 12:08:08,402 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:08,402 INFO L82 PathProgramCache]: Analyzing trace with hash -813989854, now seen corresponding path program 13 times [2021-10-03 12:08:08,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:08,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676125780] [2021-10-03 12:08:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:08,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:08,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:08,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676125780] [2021-10-03 12:08:08,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676125780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:08,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:08,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:08,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719141395] [2021-10-03 12:08:08,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:08,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:08,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:08,511 INFO L87 Difference]: Start difference. First operand 682 states and 1689 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:08,864 INFO L93 Difference]: Finished difference Result 774 states and 1903 transitions. [2021-10-03 12:08:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-03 12:08:08,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:08,870 INFO L225 Difference]: With dead ends: 774 [2021-10-03 12:08:08,870 INFO L226 Difference]: Without dead ends: 762 [2021-10-03 12:08:08,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 170.8ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:08:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2021-10-03 12:08:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 680. [2021-10-03 12:08:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 2.480117820324006) internal successors, (1684), 679 states have internal predecessors, (1684), 0 states have call successors, (0), 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-10-03 12:08:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1684 transitions. [2021-10-03 12:08:08,892 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1684 transitions. Word has length 29 [2021-10-03 12:08:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:08,893 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1684 transitions. [2021-10-03 12:08:08,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1684 transitions. [2021-10-03 12:08:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:08,895 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:08,895 INFO L512 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-10-03 12:08:08,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-03 12:08:08,895 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1782273714, now seen corresponding path program 14 times [2021-10-03 12:08:08,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:08,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471301884] [2021-10-03 12:08:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:08,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:09,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:09,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471301884] [2021-10-03 12:08:09,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471301884] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:09,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:09,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:08:09,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841401094] [2021-10-03 12:08:09,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:09,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:09,024 INFO L87 Difference]: Start difference. First operand 680 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:09,323 INFO L93 Difference]: Finished difference Result 826 states and 1987 transitions. [2021-10-03 12:08:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-03 12:08:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:09,339 INFO L225 Difference]: With dead ends: 826 [2021-10-03 12:08:09,339 INFO L226 Difference]: Without dead ends: 814 [2021-10-03 12:08:09,342 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 143.7ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-10-03 12:08:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-03 12:08:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 674. [2021-10-03 12:08:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 2.4799405646359585) internal successors, (1669), 673 states have internal predecessors, (1669), 0 states have call successors, (0), 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-10-03 12:08:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1669 transitions. [2021-10-03 12:08:09,366 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1669 transitions. Word has length 29 [2021-10-03 12:08:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:09,367 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 1669 transitions. [2021-10-03 12:08:09,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 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-10-03 12:08:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1669 transitions. [2021-10-03 12:08:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:09,370 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:09,370 INFO L512 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-10-03 12:08:09,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-03 12:08:09,371 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2026587774, now seen corresponding path program 15 times [2021-10-03 12:08:09,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:09,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945165048] [2021-10-03 12:08:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:09,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:09,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:09,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945165048] [2021-10-03 12:08:09,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945165048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:09,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:09,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:09,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453038463] [2021-10-03 12:08:09,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:08:09,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:08:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:09,479 INFO L87 Difference]: Start difference. First operand 674 states and 1669 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:09,675 INFO L93 Difference]: Finished difference Result 750 states and 1853 transitions. [2021-10-03 12:08:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:08:09,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:09,681 INFO L225 Difference]: With dead ends: 750 [2021-10-03 12:08:09,681 INFO L226 Difference]: Without dead ends: 732 [2021-10-03 12:08:09,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-03 12:08:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 650. [2021-10-03 12:08:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 2.5069337442218798) internal successors, (1627), 649 states have internal predecessors, (1627), 0 states have call successors, (0), 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-10-03 12:08:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1627 transitions. [2021-10-03 12:08:09,704 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1627 transitions. Word has length 29 [2021-10-03 12:08:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:09,705 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 1627 transitions. [2021-10-03 12:08:09,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-10-03 12:08:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1627 transitions. [2021-10-03 12:08:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:09,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:09,708 INFO L512 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-10-03 12:08:09,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-03 12:08:09,709 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:09,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:09,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1013492074, now seen corresponding path program 16 times [2021-10-03 12:08:09,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:09,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649596495] [2021-10-03 12:08:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:09,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:09,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:09,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649596495] [2021-10-03 12:08:09,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649596495] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:09,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:09,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-03 12:08:09,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806207986] [2021-10-03 12:08:09,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-03 12:08:09,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-03 12:08:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-03 12:08:09,779 INFO L87 Difference]: Start difference. First operand 650 states and 1627 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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-10-03 12:08:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:09,860 INFO L93 Difference]: Finished difference Result 582 states and 1429 transitions. [2021-10-03 12:08:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-03 12:08:09,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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-10-03 12:08:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:09,864 INFO L225 Difference]: With dead ends: 582 [2021-10-03 12:08:09,864 INFO L226 Difference]: Without dead ends: 582 [2021-10-03 12:08:09,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:08:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-03 12:08:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2021-10-03 12:08:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.472566371681416) internal successors, (1397), 565 states have internal predecessors, (1397), 0 states have call successors, (0), 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-10-03 12:08:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1397 transitions. [2021-10-03 12:08:09,881 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1397 transitions. Word has length 29 [2021-10-03 12:08:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:09,882 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1397 transitions. [2021-10-03 12:08:09,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 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-10-03 12:08:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1397 transitions. [2021-10-03 12:08:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:09,884 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:09,884 INFO L512 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-10-03 12:08:09,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-03 12:08:09,885 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1620431874, now seen corresponding path program 17 times [2021-10-03 12:08:09,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:09,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854732459] [2021-10-03 12:08:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:09,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:09,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:09,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854732459] [2021-10-03 12:08:09,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854732459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:09,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:09,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-03 12:08:09,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396476506] [2021-10-03 12:08:09,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 12:08:09,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 12:08:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-03 12:08:09,957 INFO L87 Difference]: Start difference. First operand 566 states and 1397 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 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-10-03 12:08:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:10,045 INFO L93 Difference]: Finished difference Result 584 states and 1420 transitions. [2021-10-03 12:08:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-03 12:08:10,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 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-10-03 12:08:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:10,050 INFO L225 Difference]: With dead ends: 584 [2021-10-03 12:08:10,050 INFO L226 Difference]: Without dead ends: 550 [2021-10-03 12:08:10,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-03 12:08:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-10-03 12:08:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.4571948998178508) internal successors, (1349), 549 states have internal predecessors, (1349), 0 states have call successors, (0), 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-10-03 12:08:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1349 transitions. [2021-10-03 12:08:10,066 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1349 transitions. Word has length 29 [2021-10-03 12:08:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:10,067 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1349 transitions. [2021-10-03 12:08:10,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 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-10-03 12:08:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1349 transitions. [2021-10-03 12:08:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:10,069 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:10,069 INFO L512 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-10-03 12:08:10,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-03 12:08:10,069 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:10,070 INFO L82 PathProgramCache]: Analyzing trace with hash -114895726, now seen corresponding path program 18 times [2021-10-03 12:08:10,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:10,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140350373] [2021-10-03 12:08:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:10,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:10,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:10,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140350373] [2021-10-03 12:08:10,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140350373] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:10,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:10,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:10,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329639937] [2021-10-03 12:08:10,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:10,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:10,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:10,195 INFO L87 Difference]: Start difference. First operand 550 states and 1349 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:10,348 INFO L93 Difference]: Finished difference Result 578 states and 1397 transitions. [2021-10-03 12:08:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:10,352 INFO L225 Difference]: With dead ends: 578 [2021-10-03 12:08:10,352 INFO L226 Difference]: Without dead ends: 568 [2021-10-03 12:08:10,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 96.4ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-03 12:08:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2021-10-03 12:08:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 2.4300884955752213) internal successors, (1373), 565 states have internal predecessors, (1373), 0 states have call successors, (0), 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-10-03 12:08:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1373 transitions. [2021-10-03 12:08:10,370 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1373 transitions. Word has length 29 [2021-10-03 12:08:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:10,370 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1373 transitions. [2021-10-03 12:08:10,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1373 transitions. [2021-10-03 12:08:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:10,372 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:10,373 INFO L512 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-10-03 12:08:10,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-03 12:08:10,373 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash 432794286, now seen corresponding path program 19 times [2021-10-03 12:08:10,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:10,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296300522] [2021-10-03 12:08:10,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:10,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:10,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:10,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296300522] [2021-10-03 12:08:10,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296300522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:10,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:10,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-03 12:08:10,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050159829] [2021-10-03 12:08:10,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-03 12:08:10,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:10,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-03 12:08:10,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-03 12:08:10,490 INFO L87 Difference]: Start difference. First operand 566 states and 1373 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 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-10-03 12:08:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:10,534 INFO L93 Difference]: Finished difference Result 763 states and 1820 transitions. [2021-10-03 12:08:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-03 12:08:10,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 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-10-03 12:08:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:10,537 INFO L225 Difference]: With dead ends: 763 [2021-10-03 12:08:10,537 INFO L226 Difference]: Without dead ends: 492 [2021-10-03 12:08:10,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-03 12:08:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-03 12:08:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2021-10-03 12:08:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.378818737270876) internal successors, (1168), 491 states have internal predecessors, (1168), 0 states have call successors, (0), 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-10-03 12:08:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1168 transitions. [2021-10-03 12:08:10,552 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1168 transitions. Word has length 29 [2021-10-03 12:08:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:10,553 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1168 transitions. [2021-10-03 12:08:10,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 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-10-03 12:08:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1168 transitions. [2021-10-03 12:08:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:10,555 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:10,555 INFO L512 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-10-03 12:08:10,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-03 12:08:10,555 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1810658408, now seen corresponding path program 20 times [2021-10-03 12:08:10,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:10,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655497684] [2021-10-03 12:08:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:10,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:10,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:10,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655497684] [2021-10-03 12:08:10,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655497684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:10,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:10,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:10,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056336881] [2021-10-03 12:08:10,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:10,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:10,656 INFO L87 Difference]: Start difference. First operand 492 states and 1168 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:10,824 INFO L93 Difference]: Finished difference Result 548 states and 1280 transitions. [2021-10-03 12:08:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:10,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:10,828 INFO L225 Difference]: With dead ends: 548 [2021-10-03 12:08:10,828 INFO L226 Difference]: Without dead ends: 536 [2021-10-03 12:08:10,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 103.5ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-03 12:08:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 494. [2021-10-03 12:08:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.3752535496957403) internal successors, (1171), 493 states have internal predecessors, (1171), 0 states have call successors, (0), 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-10-03 12:08:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1171 transitions. [2021-10-03 12:08:10,853 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1171 transitions. Word has length 29 [2021-10-03 12:08:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:10,854 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1171 transitions. [2021-10-03 12:08:10,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1171 transitions. [2021-10-03 12:08:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:10,856 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:10,856 INFO L512 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-10-03 12:08:10,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-03 12:08:10,856 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash 545965728, now seen corresponding path program 21 times [2021-10-03 12:08:10,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:10,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541424177] [2021-10-03 12:08:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:10,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:10,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:10,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541424177] [2021-10-03 12:08:10,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541424177] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:10,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:10,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:10,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842705494] [2021-10-03 12:08:10,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:10,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:10,975 INFO L87 Difference]: Start difference. First operand 494 states and 1171 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:11,141 INFO L93 Difference]: Finished difference Result 510 states and 1198 transitions. [2021-10-03 12:08:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:11,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:11,144 INFO L225 Difference]: With dead ends: 510 [2021-10-03 12:08:11,144 INFO L226 Difference]: Without dead ends: 492 [2021-10-03 12:08:11,144 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 110.8ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-03 12:08:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 486. [2021-10-03 12:08:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.377319587628866) internal successors, (1153), 485 states have internal predecessors, (1153), 0 states have call successors, (0), 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-10-03 12:08:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1153 transitions. [2021-10-03 12:08:11,158 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1153 transitions. Word has length 29 [2021-10-03 12:08:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:11,159 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 1153 transitions. [2021-10-03 12:08:11,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1153 transitions. [2021-10-03 12:08:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:11,160 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:11,161 INFO L512 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-10-03 12:08:11,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-03 12:08:11,161 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash 169194898, now seen corresponding path program 22 times [2021-10-03 12:08:11,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:11,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616334230] [2021-10-03 12:08:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:11,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:11,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:11,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616334230] [2021-10-03 12:08:11,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616334230] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:11,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:11,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:11,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851078899] [2021-10-03 12:08:11,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:11,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:11,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:11,276 INFO L87 Difference]: Start difference. First operand 486 states and 1153 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:11,443 INFO L93 Difference]: Finished difference Result 502 states and 1179 transitions. [2021-10-03 12:08:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:11,447 INFO L225 Difference]: With dead ends: 502 [2021-10-03 12:08:11,447 INFO L226 Difference]: Without dead ends: 482 [2021-10-03 12:08:11,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 96.3ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-10-03 12:08:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2021-10-03 12:08:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 2.375782881002088) internal successors, (1138), 479 states have internal predecessors, (1138), 0 states have call successors, (0), 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-10-03 12:08:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1138 transitions. [2021-10-03 12:08:11,471 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1138 transitions. Word has length 29 [2021-10-03 12:08:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:11,472 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 1138 transitions. [2021-10-03 12:08:11,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1138 transitions. [2021-10-03 12:08:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:11,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:11,474 INFO L512 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-10-03 12:08:11,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-03 12:08:11,475 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash 753148364, now seen corresponding path program 23 times [2021-10-03 12:08:11,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:11,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041742478] [2021-10-03 12:08:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:11,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:11,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:11,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041742478] [2021-10-03 12:08:11,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041742478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:11,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:11,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:11,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566255810] [2021-10-03 12:08:11,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:11,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:11,621 INFO L87 Difference]: Start difference. First operand 480 states and 1138 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:11,837 INFO L93 Difference]: Finished difference Result 456 states and 1015 transitions. [2021-10-03 12:08:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:11,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:11,840 INFO L225 Difference]: With dead ends: 456 [2021-10-03 12:08:11,840 INFO L226 Difference]: Without dead ends: 376 [2021-10-03 12:08:11,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-10-03 12:08:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 340. [2021-10-03 12:08:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.28023598820059) internal successors, (773), 339 states have internal predecessors, (773), 0 states have call successors, (0), 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-10-03 12:08:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 773 transitions. [2021-10-03 12:08:11,850 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 773 transitions. Word has length 29 [2021-10-03 12:08:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:11,852 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 773 transitions. [2021-10-03 12:08:11,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 773 transitions. [2021-10-03 12:08:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:11,853 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:11,853 INFO L512 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-10-03 12:08:11,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-03 12:08:11,854 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1412239072, now seen corresponding path program 24 times [2021-10-03 12:08:11,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:11,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679857564] [2021-10-03 12:08:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:11,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:11,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:11,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679857564] [2021-10-03 12:08:11,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679857564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:11,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:11,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:11,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768241721] [2021-10-03 12:08:11,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:11,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:11,988 INFO L87 Difference]: Start difference. First operand 340 states and 773 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:12,160 INFO L93 Difference]: Finished difference Result 354 states and 796 transitions. [2021-10-03 12:08:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:08:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:12,162 INFO L225 Difference]: With dead ends: 354 [2021-10-03 12:08:12,162 INFO L226 Difference]: Without dead ends: 324 [2021-10-03 12:08:12,163 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 101.3ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-03 12:08:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-10-03 12:08:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.2755417956656347) internal successors, (735), 323 states have internal predecessors, (735), 0 states have call successors, (0), 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-10-03 12:08:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 735 transitions. [2021-10-03 12:08:12,172 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 735 transitions. Word has length 29 [2021-10-03 12:08:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:12,172 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 735 transitions. [2021-10-03 12:08:12,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 735 transitions. [2021-10-03 12:08:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:12,173 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:12,174 INFO L512 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-10-03 12:08:12,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-03 12:08:12,174 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1561620626, now seen corresponding path program 25 times [2021-10-03 12:08:12,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:12,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996151487] [2021-10-03 12:08:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:12,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:12,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:12,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996151487] [2021-10-03 12:08:12,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996151487] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:12,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:12,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:12,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116566043] [2021-10-03 12:08:12,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:12,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:12,267 INFO L87 Difference]: Start difference. First operand 324 states and 735 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:12,405 INFO L93 Difference]: Finished difference Result 372 states and 830 transitions. [2021-10-03 12:08:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:12,408 INFO L225 Difference]: With dead ends: 372 [2021-10-03 12:08:12,409 INFO L226 Difference]: Without dead ends: 360 [2021-10-03 12:08:12,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:08:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-10-03 12:08:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2021-10-03 12:08:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.2693498452012384) internal successors, (733), 323 states have internal predecessors, (733), 0 states have call successors, (0), 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-10-03 12:08:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 733 transitions. [2021-10-03 12:08:12,418 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 733 transitions. Word has length 29 [2021-10-03 12:08:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:12,418 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 733 transitions. [2021-10-03 12:08:12,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 733 transitions. [2021-10-03 12:08:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:12,419 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:12,419 INFO L512 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-10-03 12:08:12,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-03 12:08:12,420 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash -660925870, now seen corresponding path program 26 times [2021-10-03 12:08:12,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:12,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112699805] [2021-10-03 12:08:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:12,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:12,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:12,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112699805] [2021-10-03 12:08:12,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112699805] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:12,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:12,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:12,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048237853] [2021-10-03 12:08:12,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:12,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:12,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:12,520 INFO L87 Difference]: Start difference. First operand 324 states and 733 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:12,680 INFO L93 Difference]: Finished difference Result 372 states and 828 transitions. [2021-10-03 12:08:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:12,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:12,683 INFO L225 Difference]: With dead ends: 372 [2021-10-03 12:08:12,683 INFO L226 Difference]: Without dead ends: 344 [2021-10-03 12:08:12,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 87.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-10-03 12:08:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2021-10-03 12:08:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 2.2633228840125392) internal successors, (722), 319 states have internal predecessors, (722), 0 states have call successors, (0), 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-10-03 12:08:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 722 transitions. [2021-10-03 12:08:12,692 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 722 transitions. Word has length 29 [2021-10-03 12:08:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:12,692 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 722 transitions. [2021-10-03 12:08:12,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 722 transitions. [2021-10-03 12:08:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:12,693 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:12,694 INFO L512 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-10-03 12:08:12,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-03 12:08:12,694 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 30845594, now seen corresponding path program 27 times [2021-10-03 12:08:12,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:12,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106212797] [2021-10-03 12:08:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:12,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:12,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:12,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106212797] [2021-10-03 12:08:12,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106212797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:12,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:12,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:12,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575230445] [2021-10-03 12:08:12,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:12,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:12,793 INFO L87 Difference]: Start difference. First operand 320 states and 722 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:12,960 INFO L93 Difference]: Finished difference Result 328 states and 734 transitions. [2021-10-03 12:08:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:12,963 INFO L225 Difference]: With dead ends: 328 [2021-10-03 12:08:12,963 INFO L226 Difference]: Without dead ends: 316 [2021-10-03 12:08:12,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 108.7ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-03 12:08:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-10-03 12:08:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.2603174603174603) internal successors, (712), 315 states have internal predecessors, (712), 0 states have call successors, (0), 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-10-03 12:08:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 712 transitions. [2021-10-03 12:08:12,977 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 712 transitions. Word has length 29 [2021-10-03 12:08:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:12,977 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 712 transitions. [2021-10-03 12:08:12,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 712 transitions. [2021-10-03 12:08:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:12,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:12,979 INFO L512 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-10-03 12:08:12,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-03 12:08:12,979 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1233847086, now seen corresponding path program 28 times [2021-10-03 12:08:12,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:12,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405867934] [2021-10-03 12:08:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:12,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:13,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:13,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405867934] [2021-10-03 12:08:13,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405867934] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:13,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:13,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:13,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685809386] [2021-10-03 12:08:13,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:13,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:13,119 INFO L87 Difference]: Start difference. First operand 316 states and 712 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:13,293 INFO L93 Difference]: Finished difference Result 326 states and 727 transitions. [2021-10-03 12:08:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:13,296 INFO L225 Difference]: With dead ends: 326 [2021-10-03 12:08:13,296 INFO L226 Difference]: Without dead ends: 314 [2021-10-03 12:08:13,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 119.9ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-03 12:08:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-10-03 12:08:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.258785942492013) internal successors, (707), 313 states have internal predecessors, (707), 0 states have call successors, (0), 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-10-03 12:08:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 707 transitions. [2021-10-03 12:08:13,305 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 707 transitions. Word has length 29 [2021-10-03 12:08:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:13,306 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 707 transitions. [2021-10-03 12:08:13,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 707 transitions. [2021-10-03 12:08:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:13,307 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:13,307 INFO L512 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-10-03 12:08:13,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-03 12:08:13,308 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1106294632, now seen corresponding path program 29 times [2021-10-03 12:08:13,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:13,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031142968] [2021-10-03 12:08:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:13,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:13,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:13,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031142968] [2021-10-03 12:08:13,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031142968] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:13,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:13,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:13,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845244587] [2021-10-03 12:08:13,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:13,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:13,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:13,423 INFO L87 Difference]: Start difference. First operand 314 states and 707 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:13,593 INFO L93 Difference]: Finished difference Result 326 states and 727 transitions. [2021-10-03 12:08:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:08:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:13,594 INFO L225 Difference]: With dead ends: 326 [2021-10-03 12:08:13,595 INFO L226 Difference]: Without dead ends: 302 [2021-10-03 12:08:13,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:08:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-03 12:08:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2021-10-03 12:08:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.259136212624585) internal successors, (680), 301 states have internal predecessors, (680), 0 states have call successors, (0), 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-10-03 12:08:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 680 transitions. [2021-10-03 12:08:13,604 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 680 transitions. Word has length 29 [2021-10-03 12:08:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:13,605 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 680 transitions. [2021-10-03 12:08:13,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 680 transitions. [2021-10-03 12:08:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:13,606 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:13,607 INFO L512 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-10-03 12:08:13,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-03 12:08:13,607 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1059092804, now seen corresponding path program 30 times [2021-10-03 12:08:13,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:13,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047342641] [2021-10-03 12:08:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:13,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:08:13,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:13,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047342641] [2021-10-03 12:08:13,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047342641] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:13,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:13,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:08:13,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590245427] [2021-10-03 12:08:13,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 12:08:13,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 12:08:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-03 12:08:13,711 INFO L87 Difference]: Start difference. First operand 302 states and 680 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:13,869 INFO L93 Difference]: Finished difference Result 284 states and 639 transitions. [2021-10-03 12:08:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:08:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:13,873 INFO L225 Difference]: With dead ends: 284 [2021-10-03 12:08:13,873 INFO L226 Difference]: Without dead ends: 250 [2021-10-03 12:08:13,873 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 104.9ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-03 12:08:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-10-03 12:08:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.325301204819277) internal successors, (579), 249 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:08:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2021-10-03 12:08:13,879 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 29 [2021-10-03 12:08:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:13,880 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2021-10-03 12:08:13,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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-10-03 12:08:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2021-10-03 12:08:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-03 12:08:13,881 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:08:13,881 INFO L512 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-10-03 12:08:13,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-03 12:08:13,881 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:08:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:08:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash 213690724, now seen corresponding path program 31 times [2021-10-03 12:08:13,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:08:13,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259562222] [2021-10-03 12:08:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:08:13,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:08:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:08:14,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-10-03 12:08:14,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:08:14,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259562222] [2021-10-03 12:08:14,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259562222] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:08:14,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:08:14,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-03 12:08:14,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299132701] [2021-10-03 12:08:14,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:08:14,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:08:14,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:08:14,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:08:14,027 INFO L87 Difference]: Start difference. First operand 250 states and 579 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 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-10-03 12:08:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:08:14,164 INFO L93 Difference]: Finished difference Result 249 states and 578 transitions. [2021-10-03 12:08:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-03 12:08:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 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-10-03 12:08:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:08:14,165 INFO L225 Difference]: With dead ends: 249 [2021-10-03 12:08:14,165 INFO L226 Difference]: Without dead ends: 0 [2021-10-03 12:08:14,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 121.6ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:08:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-03 12:08:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-03 12:08:14,167 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-10-03 12:08:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-03 12:08:14,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2021-10-03 12:08:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:08:14,168 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-03 12:08:14,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 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-10-03 12:08:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-03 12:08:14,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-03 12:08:14,172 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-03 12:08:14,173 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-03 12:08:14,173 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-03 12:08:14,173 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-03 12:08:14,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-03 12:08:14,179 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-03 12:08:14,179 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-03 12:08:14,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 12:08:14 BasicIcfg [2021-10-03 12:08:14,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-03 12:08:14,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-03 12:08:14,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-03 12:08:14,187 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-03 12:08:14,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:07:57" (3/4) ... [2021-10-03 12:08:14,192 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-03 12:08:14,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-03 12:08:14,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-03 12:08:14,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-03 12:08:14,210 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-10-03 12:08:14,210 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-03 12:08:14,211 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-03 12:08:14,257 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-03 12:08:14,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-03 12:08:14,260 INFO L168 Benchmark]: Toolchain (without parser) took 17898.47 ms. Allocated memory was 60.8 MB in the beginning and 130.0 MB in the end (delta: 69.2 MB). Free memory was 36.6 MB in the beginning and 106.7 MB in the end (delta: -70.1 MB). Peak memory consumption was 75.9 MB. Max. memory is 16.1 GB. [2021-10-03 12:08:14,261 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 46.1 MB. Free memory was 25.0 MB in the beginning and 24.9 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-03 12:08:14,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.20 ms. Allocated memory is still 60.8 MB. Free memory was 36.3 MB in the beginning and 41.5 MB in the end (delta: -5.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-10-03 12:08:14,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.29 ms. Allocated memory is still 60.8 MB. Free memory was 41.5 MB in the beginning and 39.7 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-03 12:08:14,262 INFO L168 Benchmark]: Boogie Preprocessor took 64.44 ms. Allocated memory is still 60.8 MB. Free memory was 39.6 MB in the beginning and 38.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:08:14,263 INFO L168 Benchmark]: RCFGBuilder took 632.25 ms. Allocated memory is still 60.8 MB. Free memory was 38.3 MB in the beginning and 39.0 MB in the end (delta: -697.6 kB). Peak memory consumption was 12.4 MB. Max. memory is 16.1 GB. [2021-10-03 12:08:14,263 INFO L168 Benchmark]: TraceAbstraction took 16712.89 ms. Allocated memory was 60.8 MB in the beginning and 130.0 MB in the end (delta: 69.2 MB). Free memory was 38.7 MB in the beginning and 33.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 74.6 MB. Max. memory is 16.1 GB. [2021-10-03 12:08:14,264 INFO L168 Benchmark]: Witness Printer took 71.92 ms. Allocated memory is still 130.0 MB. Free memory was 33.3 MB in the beginning and 106.7 MB in the end (delta: -73.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:08:14,266 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.31 ms. Allocated memory is still 46.1 MB. Free memory was 25.0 MB in the beginning and 24.9 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 300.20 ms. Allocated memory is still 60.8 MB. Free memory was 36.3 MB in the beginning and 41.5 MB in the end (delta: -5.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.29 ms. Allocated memory is still 60.8 MB. Free memory was 41.5 MB in the beginning and 39.7 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.44 ms. Allocated memory is still 60.8 MB. Free memory was 39.6 MB in the beginning and 38.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 632.25 ms. Allocated memory is still 60.8 MB. Free memory was 38.3 MB in the beginning and 39.0 MB in the end (delta: -697.6 kB). Peak memory consumption was 12.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16712.89 ms. Allocated memory was 60.8 MB in the beginning and 130.0 MB in the end (delta: 69.2 MB). Free memory was 38.7 MB in the beginning and 33.3 MB in the end (delta: 5.5 MB). Peak memory consumption was 74.6 MB. Max. memory is 16.1 GB. * Witness Printer took 71.92 ms. Allocated memory is still 130.0 MB. Free memory was 33.3 MB in the beginning and 106.7 MB in the end (delta: -73.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4079.2ms, 130 PlacesBefore, 43 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 5 ConcurrentYvCompositions, 4 ChoiceCompositions, 104 TotalNumberOfCompositions, 5807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2801, positive: 2603, positive conditional: 0, positive unconditional: 2603, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1443, positive: 1389, positive conditional: 0, positive unconditional: 1389, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1443, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2801, positive: 1214, positive conditional: 0, positive unconditional: 1214, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 1443, unknown conditional: 0, unknown unconditional: 1443] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 83]: 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 with 1 thread instances CFG has 7 procedures, 164 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16541.0ms, OverallIterations: 32, TraceHistogramMax: 1, EmptinessCheckTime: 99.5ms, AutomataDifference: 7024.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4196.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1521 SDtfs, 2045 SDslu, 6360 SDs, 0 SdLazy, 6039 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3346.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3267.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=4, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 728.0ms AutomataMinimizationTime, 32 MinimizatonAttempts, 1422 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 87.8ms SsaConstructionTime, 938.4ms SatisfiabilityAnalysisTime, 3027.1ms InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 3869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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 RESULT: Ultimate proved your program to be correct! [2021-10-03 12:08:14,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...