./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 5d9ece94623708e086a6238f50b392b7d4529030 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 14:39:09,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-08 14:39:09,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-08 14:39:09,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-08 14:39:09,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-08 14:39:09,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-08 14:39:09,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-08 14:39:09,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-08 14:39:09,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-08 14:39:09,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-08 14:39:09,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-08 14:39:09,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-08 14:39:09,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-08 14:39:09,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-08 14:39:09,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-08 14:39:09,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-08 14:39:09,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-08 14:39:09,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-08 14:39:09,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-08 14:39:09,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-08 14:39:09,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-08 14:39:09,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-08 14:39:09,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-08 14:39:09,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-08 14:39:09,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-08 14:39:09,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-08 14:39:09,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-08 14:39:09,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-08 14:39:09,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-08 14:39:09,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-08 14:39:09,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-08 14:39:09,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-08 14:39:09,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-08 14:39:09,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-08 14:39:09,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-08 14:39:09,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-08 14:39:09,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-08 14:39:09,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-08 14:39:09,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-08 14:39:09,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-08 14:39:09,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-08 14:39:09,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-08 14:39:09,661 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-08 14:39:09,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-08 14:39:09,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-08 14:39:09,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-08 14:39:09,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-08 14:39:09,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-08 14:39:09,665 INFO L138 SettingsManager]: * Use SBE=true [2021-10-08 14:39:09,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-08 14:39:09,666 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-08 14:39:09,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-08 14:39:09,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-08 14:39:09,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-08 14:39:09,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-08 14:39:09,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-08 14:39:09,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-08 14:39:09,669 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-08 14:39:09,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-08 14:39:09,669 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-08 14:39:09,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-08 14:39:09,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-08 14:39:09,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-08 14:39:09,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-08 14:39:09,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 14:39:09,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-08 14:39:09,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-08 14:39:09,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-08 14:39:09,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-08 14:39:09,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-08 14:39:09,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-08 14:39:09,676 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-08 14:39:09,677 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 -> 5d9ece94623708e086a6238f50b392b7d4529030 [2021-10-08 14:39:10,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-08 14:39:10,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-08 14:39:10,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-08 14:39:10,236 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-08 14:39:10,237 INFO L275 PluginConnector]: CDTParser initialized [2021-10-08 14:39:10,239 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-08 14:39:10,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/82858b400/1d0bde90b3de463581874305abe08fa4/FLAG6a90cf8e7 [2021-10-08 14:39:11,052 INFO L306 CDTParser]: Found 1 translation units. [2021-10-08 14:39:11,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2021-10-08 14:39:11,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/82858b400/1d0bde90b3de463581874305abe08fa4/FLAG6a90cf8e7 [2021-10-08 14:39:11,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/82858b400/1d0bde90b3de463581874305abe08fa4 [2021-10-08 14:39:11,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-08 14:39:11,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-08 14:39:11,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-08 14:39:11,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-08 14:39:11,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-08 14:39:11,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225cb3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11, skipping insertion in model container [2021-10-08 14:39:11,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-08 14:39:11,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-08 14:39:11,717 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[2520,2533] [2021-10-08 14:39:11,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 14:39:11,735 INFO L203 MainTranslator]: Completed pre-run [2021-10-08 14:39:11,775 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[2520,2533] [2021-10-08 14:39:11,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 14:39:11,801 INFO L208 MainTranslator]: Completed translation [2021-10-08 14:39:11,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11 WrapperNode [2021-10-08 14:39:11,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-08 14:39:11,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-08 14:39:11,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-08 14:39:11,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-08 14:39:11,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-08 14:39:11,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-08 14:39:11,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-08 14:39:11,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-08 14:39:11,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-08 14:39:11,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-08 14:39:11,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-08 14:39:11,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-08 14:39:11,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (1/1) ... [2021-10-08 14:39:11,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 14:39:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 14:39:11,958 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-08 14:39:11,977 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-08 14:39:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-08 14:39:12,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-08 14:39:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-08 14:39:12,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-08 14:39:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-08 14:39:12,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-08 14:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-08 14:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-08 14:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-08 14:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-08 14:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-08 14:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-08 14:39:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-08 14:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-08 14:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-08 14:39:12,030 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-08 14:39:12,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-08 14:39:12,619 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-10-08 14:39:12,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 02:39:12 BoogieIcfgContainer [2021-10-08 14:39:12,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-08 14:39:12,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-08 14:39:12,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-08 14:39:12,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-08 14:39:12,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.10 02:39:11" (1/3) ... [2021-10-08 14:39:12,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cef0c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 02:39:12, skipping insertion in model container [2021-10-08 14:39:12,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 02:39:11" (2/3) ... [2021-10-08 14:39:12,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cef0c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 02:39:12, skipping insertion in model container [2021-10-08 14:39:12,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 02:39:12" (3/3) ... [2021-10-08 14:39:12,639 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2021-10-08 14:39:12,645 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-08 14:39:12,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-08 14:39:12,646 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-08 14:39:12,646 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-08 14:39:12,712 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,712 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,713 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,713 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,713 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,714 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,714 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,714 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,714 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,715 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,715 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,715 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,716 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,716 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,717 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,717 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,717 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,718 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,718 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,718 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,718 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,718 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,720 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,720 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,721 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,721 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,722 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,722 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,722 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,723 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,723 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,723 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,723 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,724 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,724 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,725 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,725 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,725 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,725 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,726 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,726 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,726 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,727 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,727 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,727 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,727 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,728 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,728 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,729 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,729 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,729 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,731 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,732 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,732 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,732 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,733 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,733 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,733 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,733 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,734 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,736 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,737 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,737 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,738 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,738 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,738 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,739 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,740 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,740 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,741 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,741 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,741 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,750 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,750 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,751 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,751 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,751 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,752 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,759 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,759 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,760 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,760 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,760 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,760 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,763 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,764 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,765 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,765 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,768 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,768 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 14:39:12,788 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-08 14:39:12,852 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-08 14:39:12,872 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-08 14:39:12,874 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-08 14:39:12,905 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-08 14:39:12,917 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 132 transitions, 288 flow [2021-10-08 14:39:12,920 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 132 transitions, 288 flow [2021-10-08 14:39:12,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 132 transitions, 288 flow [2021-10-08 14:39:13,026 INFO L129 PetriNetUnfolder]: 5/129 cut-off events. [2021-10-08 14:39:13,026 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-08 14:39:13,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 5/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-10-08 14:39:13,039 INFO L116 LiptonReduction]: Number of co-enabled transitions 2032 [2021-10-08 14:39:17,600 INFO L131 LiptonReduction]: Checked pairs total: 6055 [2021-10-08 14:39:17,600 INFO L133 LiptonReduction]: Total number of compositions: 113 [2021-10-08 14:39:17,608 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 92 flow [2021-10-08 14:39:17,672 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 689 states have (on average 3.036284470246734) internal successors, (2092), 689 states have internal predecessors, (2092), 0 states have call successors, (0), 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-08 14:39:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 689 states have (on average 3.036284470246734) internal successors, (2092), 689 states have internal predecessors, (2092), 0 states have call successors, (0), 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-08 14:39:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-08 14:39:17,706 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:17,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] [2021-10-08 14:39:17,709 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-08 14:39:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1454676914, now seen corresponding path program 1 times [2021-10-08 14:39:17,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:17,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833559585] [2021-10-08 14:39:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:17,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:17,988 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-08 14:39:17,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:17,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833559585] [2021-10-08 14:39:17,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833559585] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:17,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:17,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 14:39:17,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590699341] [2021-10-08 14:39:18,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-08 14:39:18,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-08 14:39:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 14:39:18,027 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 3.036284470246734) internal successors, (2092), 689 states have internal predecessors, (2092), 0 states have call successors, (0), 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-08 14:39:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:18,088 INFO L93 Difference]: Finished difference Result 690 states and 1994 transitions. [2021-10-08 14:39:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-08 14:39:18,090 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-08 14:39:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:18,113 INFO L225 Difference]: With dead ends: 690 [2021-10-08 14:39:18,113 INFO L226 Difference]: Without dead ends: 690 [2021-10-08 14:39:18,114 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-08 14:39:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-08 14:39:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2021-10-08 14:39:18,226 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-08 14:39:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1994 transitions. [2021-10-08 14:39:18,235 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1994 transitions. Word has length 25 [2021-10-08 14:39:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:18,236 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1994 transitions. [2021-10-08 14:39:18,237 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-08 14:39:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1994 transitions. [2021-10-08 14:39:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:18,248 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:18,248 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-08 14:39:18,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-08 14:39:18,249 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-08 14:39:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 954248746, now seen corresponding path program 1 times [2021-10-08 14:39:18,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:18,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521986054] [2021-10-08 14:39:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:18,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:18,640 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-08 14:39:18,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:18,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521986054] [2021-10-08 14:39:18,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521986054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:18,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:18,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-08 14:39:18,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207918052] [2021-10-08 14:39:18,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-08 14:39:18,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:18,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-08 14:39:18,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-08 14:39:18,646 INFO L87 Difference]: Start difference. First operand 690 states and 1994 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-08 14:39:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:18,808 INFO L93 Difference]: Finished difference Result 866 states and 2542 transitions. [2021-10-08 14:39:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-08 14:39:18,809 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-08 14:39:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:18,818 INFO L225 Difference]: With dead ends: 866 [2021-10-08 14:39:18,818 INFO L226 Difference]: Without dead ends: 866 [2021-10-08 14:39:18,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.6ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:39:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-10-08 14:39:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2021-10-08 14:39:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 2.938728323699422) internal successors, (2542), 865 states have internal predecessors, (2542), 0 states have call successors, (0), 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-08 14:39:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2542 transitions. [2021-10-08 14:39:18,864 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2542 transitions. Word has length 29 [2021-10-08 14:39:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:18,864 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 2542 transitions. [2021-10-08 14:39:18,865 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-08 14:39:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2542 transitions. [2021-10-08 14:39:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:18,869 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:18,869 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-08 14:39:18,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-08 14:39:18,870 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-08 14:39:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1790264580, now seen corresponding path program 2 times [2021-10-08 14:39:18,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:18,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900261492] [2021-10-08 14:39:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:18,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:19,058 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-08 14:39:19,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:19,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900261492] [2021-10-08 14:39:19,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900261492] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:19,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:19,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-08 14:39:19,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021941015] [2021-10-08 14:39:19,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:39:19,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:39:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:39:19,062 INFO L87 Difference]: Start difference. First operand 866 states and 2542 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-08 14:39:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:19,269 INFO L93 Difference]: Finished difference Result 910 states and 2616 transitions. [2021-10-08 14:39:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-08 14:39:19,270 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-08 14:39:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:19,277 INFO L225 Difference]: With dead ends: 910 [2021-10-08 14:39:19,277 INFO L226 Difference]: Without dead ends: 818 [2021-10-08 14:39:19,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.1ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-10-08 14:39:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2021-10-08 14:39:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2021-10-08 14:39:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 2.905752753977968) internal successors, (2374), 817 states have internal predecessors, (2374), 0 states have call successors, (0), 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-08 14:39:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2374 transitions. [2021-10-08 14:39:19,326 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2374 transitions. Word has length 29 [2021-10-08 14:39:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:19,326 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 2374 transitions. [2021-10-08 14:39:19,326 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-08 14:39:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2374 transitions. [2021-10-08 14:39:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:19,329 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:19,330 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-08 14:39:19,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-08 14:39:19,330 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-08 14:39:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash -846317378, now seen corresponding path program 3 times [2021-10-08 14:39:19,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:19,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250484049] [2021-10-08 14:39:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:19,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:19,531 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-08 14:39:19,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:19,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250484049] [2021-10-08 14:39:19,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250484049] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:19,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:19,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-08 14:39:19,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785952273] [2021-10-08 14:39:19,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-08 14:39:19,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-08 14:39:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-08 14:39:19,535 INFO L87 Difference]: Start difference. First operand 818 states and 2374 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-08 14:39:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:19,651 INFO L93 Difference]: Finished difference Result 834 states and 2406 transitions. [2021-10-08 14:39:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-08 14:39:19,651 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-08 14:39:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:19,658 INFO L225 Difference]: With dead ends: 834 [2021-10-08 14:39:19,658 INFO L226 Difference]: Without dead ends: 834 [2021-10-08 14:39:19,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-08 14:39:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2021-10-08 14:39:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2021-10-08 14:39:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 2.8883553421368546) internal successors, (2406), 833 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-08 14:39:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2406 transitions. [2021-10-08 14:39:19,692 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 2406 transitions. Word has length 29 [2021-10-08 14:39:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:19,692 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 2406 transitions. [2021-10-08 14:39:19,693 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-08 14:39:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 2406 transitions. [2021-10-08 14:39:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:19,711 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:19,711 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-08 14:39:19,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-08 14:39:19,712 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-08 14:39:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash -656194946, now seen corresponding path program 4 times [2021-10-08 14:39:19,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:19,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028024838] [2021-10-08 14:39:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:19,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:19,852 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-08 14:39:19,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:19,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028024838] [2021-10-08 14:39:19,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028024838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:19,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:19,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-08 14:39:19,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574133189] [2021-10-08 14:39:19,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-08 14:39:19,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-08 14:39:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 14:39:19,855 INFO L87 Difference]: Start difference. First operand 834 states and 2406 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-08 14:39:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:19,991 INFO L93 Difference]: Finished difference Result 844 states and 2419 transitions. [2021-10-08 14:39:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-08 14:39:19,992 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-08 14:39:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:19,999 INFO L225 Difference]: With dead ends: 844 [2021-10-08 14:39:19,999 INFO L226 Difference]: Without dead ends: 826 [2021-10-08 14:39:20,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-10-08 14:39:20,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2021-10-08 14:39:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 2.892121212121212) internal successors, (2386), 825 states have internal predecessors, (2386), 0 states have call successors, (0), 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-08 14:39:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2386 transitions. [2021-10-08 14:39:20,040 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2386 transitions. Word has length 29 [2021-10-08 14:39:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:20,041 INFO L470 AbstractCegarLoop]: Abstraction has 826 states and 2386 transitions. [2021-10-08 14:39:20,041 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-08 14:39:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2386 transitions. [2021-10-08 14:39:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:20,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:20,044 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-08 14:39:20,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-08 14:39:20,045 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-08 14:39:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1874715464, now seen corresponding path program 5 times [2021-10-08 14:39:20,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:20,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624606346] [2021-10-08 14:39:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:20,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:20,186 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-08 14:39:20,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:20,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624606346] [2021-10-08 14:39:20,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624606346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:20,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:20,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:20,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807432110] [2021-10-08 14:39:20,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:20,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:20,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:20,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:20,188 INFO L87 Difference]: Start difference. First operand 826 states and 2386 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-08 14:39:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:20,382 INFO L93 Difference]: Finished difference Result 786 states and 2199 transitions. [2021-10-08 14:39:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:39:20,383 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-08 14:39:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:20,388 INFO L225 Difference]: With dead ends: 786 [2021-10-08 14:39:20,389 INFO L226 Difference]: Without dead ends: 740 [2021-10-08 14:39:20,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 101.5ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-08 14:39:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 738. [2021-10-08 14:39:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 2.8303934871099052) internal successors, (2086), 737 states have internal predecessors, (2086), 0 states have call successors, (0), 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-08 14:39:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2086 transitions. [2021-10-08 14:39:20,426 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2086 transitions. Word has length 29 [2021-10-08 14:39:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:20,427 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 2086 transitions. [2021-10-08 14:39:20,427 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-08 14:39:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2086 transitions. [2021-10-08 14:39:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:20,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:20,430 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-08 14:39:20,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-08 14:39:20,430 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-08 14:39:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1904211004, now seen corresponding path program 6 times [2021-10-08 14:39:20,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:20,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635090426] [2021-10-08 14:39:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:20,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:20,559 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-08 14:39:20,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:20,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635090426] [2021-10-08 14:39:20,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635090426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:20,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:20,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 14:39:20,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236904430] [2021-10-08 14:39:20,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 14:39:20,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 14:39:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-08 14:39:20,562 INFO L87 Difference]: Start difference. First operand 738 states and 2086 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-08 14:39:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:20,613 INFO L93 Difference]: Finished difference Result 1045 states and 2911 transitions. [2021-10-08 14:39:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 14:39:20,613 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-08 14:39:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:20,619 INFO L225 Difference]: With dead ends: 1045 [2021-10-08 14:39:20,619 INFO L226 Difference]: Without dead ends: 710 [2021-10-08 14:39:20,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-08 14:39:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2021-10-08 14:39:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2021-10-08 14:39:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 2.757404795486601) internal successors, (1955), 709 states have internal predecessors, (1955), 0 states have call successors, (0), 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-08 14:39:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1955 transitions. [2021-10-08 14:39:20,644 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1955 transitions. Word has length 29 [2021-10-08 14:39:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:20,645 INFO L470 AbstractCegarLoop]: Abstraction has 710 states and 1955 transitions. [2021-10-08 14:39:20,645 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-08 14:39:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1955 transitions. [2021-10-08 14:39:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:20,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:20,648 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-08 14:39:20,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-08 14:39:20,648 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-08 14:39:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1150274804, now seen corresponding path program 7 times [2021-10-08 14:39:20,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:20,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89840924] [2021-10-08 14:39:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:20,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:20,776 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-08 14:39:20,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:20,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89840924] [2021-10-08 14:39:20,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89840924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:20,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:20,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:20,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603670135] [2021-10-08 14:39:20,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:20,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:20,779 INFO L87 Difference]: Start difference. First operand 710 states and 1955 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-08 14:39:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:21,001 INFO L93 Difference]: Finished difference Result 840 states and 2254 transitions. [2021-10-08 14:39:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:39:21,002 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-08 14:39:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:21,008 INFO L225 Difference]: With dead ends: 840 [2021-10-08 14:39:21,008 INFO L226 Difference]: Without dead ends: 786 [2021-10-08 14:39:21,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 101.7ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-10-08 14:39:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 744. [2021-10-08 14:39:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.732166890982503) internal successors, (2030), 743 states have internal predecessors, (2030), 0 states have call successors, (0), 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-08 14:39:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2030 transitions. [2021-10-08 14:39:21,035 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2030 transitions. Word has length 29 [2021-10-08 14:39:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:21,036 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2030 transitions. [2021-10-08 14:39:21,036 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-08 14:39:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2030 transitions. [2021-10-08 14:39:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:21,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:21,039 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-08 14:39:21,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-08 14:39:21,039 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-08 14:39:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1175131616, now seen corresponding path program 8 times [2021-10-08 14:39:21,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:21,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924136083] [2021-10-08 14:39:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:21,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:21,176 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-08 14:39:21,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:21,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924136083] [2021-10-08 14:39:21,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924136083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:21,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:21,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:21,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446736794] [2021-10-08 14:39:21,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:21,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:21,178 INFO L87 Difference]: Start difference. First operand 744 states and 2030 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-08 14:39:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:21,364 INFO L93 Difference]: Finished difference Result 760 states and 2057 transitions. [2021-10-08 14:39:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:39:21,365 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-08 14:39:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:21,370 INFO L225 Difference]: With dead ends: 760 [2021-10-08 14:39:21,371 INFO L226 Difference]: Without dead ends: 742 [2021-10-08 14:39:21,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 96.8ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2021-10-08 14:39:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 736. [2021-10-08 14:39:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.7374149659863947) internal successors, (2012), 735 states have internal predecessors, (2012), 0 states have call successors, (0), 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-08 14:39:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2012 transitions. [2021-10-08 14:39:21,399 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2012 transitions. Word has length 29 [2021-10-08 14:39:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:21,399 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 2012 transitions. [2021-10-08 14:39:21,400 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-08 14:39:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2012 transitions. [2021-10-08 14:39:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:21,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:21,403 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-08 14:39:21,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-08 14:39:21,404 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-08 14:39:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1778046766, now seen corresponding path program 9 times [2021-10-08 14:39:21,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:21,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844910919] [2021-10-08 14:39:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:21,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:21,547 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-08 14:39:21,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:21,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844910919] [2021-10-08 14:39:21,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844910919] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:21,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:21,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:21,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659494598] [2021-10-08 14:39:21,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:21,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:21,551 INFO L87 Difference]: Start difference. First operand 736 states and 2012 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-08 14:39:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:21,675 INFO L93 Difference]: Finished difference Result 752 states and 2038 transitions. [2021-10-08 14:39:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-08 14:39:21,676 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-08 14:39:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:21,681 INFO L225 Difference]: With dead ends: 752 [2021-10-08 14:39:21,682 INFO L226 Difference]: Without dead ends: 732 [2021-10-08 14:39:21,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-08 14:39:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-08 14:39:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2021-10-08 14:39:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 2.7393689986282577) internal successors, (1997), 729 states have internal predecessors, (1997), 0 states have call successors, (0), 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-08 14:39:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1997 transitions. [2021-10-08 14:39:21,710 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1997 transitions. Word has length 29 [2021-10-08 14:39:21,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:21,711 INFO L470 AbstractCegarLoop]: Abstraction has 730 states and 1997 transitions. [2021-10-08 14:39:21,711 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-08 14:39:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1997 transitions. [2021-10-08 14:39:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:21,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:21,714 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-08 14:39:21,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-08 14:39:21,714 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-08 14:39:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash 361912820, now seen corresponding path program 10 times [2021-10-08 14:39:21,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:21,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568347964] [2021-10-08 14:39:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:21,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:21,885 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-08 14:39:21,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:21,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568347964] [2021-10-08 14:39:21,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568347964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:21,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:21,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:21,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715950501] [2021-10-08 14:39:21,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:21,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:21,889 INFO L87 Difference]: Start difference. First operand 730 states and 1997 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-08 14:39:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:22,258 INFO L93 Difference]: Finished difference Result 836 states and 1995 transitions. [2021-10-08 14:39:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-08 14:39:22,258 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-08 14:39:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:22,263 INFO L225 Difference]: With dead ends: 836 [2021-10-08 14:39:22,264 INFO L226 Difference]: Without dead ends: 684 [2021-10-08 14:39:22,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 125.6ms TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2021-10-08 14:39:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-10-08 14:39:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 578. [2021-10-08 14:39:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 2.4540727902946275) internal successors, (1416), 577 states have internal predecessors, (1416), 0 states have call successors, (0), 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-08 14:39:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1416 transitions. [2021-10-08 14:39:22,285 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1416 transitions. Word has length 29 [2021-10-08 14:39:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:22,285 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 1416 transitions. [2021-10-08 14:39:22,285 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-08 14:39:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1416 transitions. [2021-10-08 14:39:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:22,287 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:22,287 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-08 14:39:22,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-08 14:39:22,288 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-08 14:39:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1500886082, now seen corresponding path program 11 times [2021-10-08 14:39:22,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:22,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275656295] [2021-10-08 14:39:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:22,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:22,422 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-08 14:39:22,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:22,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275656295] [2021-10-08 14:39:22,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275656295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:22,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:22,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:22,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649080546] [2021-10-08 14:39:22,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:22,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:22,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:22,426 INFO L87 Difference]: Start difference. First operand 578 states and 1416 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-08 14:39:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:22,580 INFO L93 Difference]: Finished difference Result 592 states and 1439 transitions. [2021-10-08 14:39:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-08 14:39:22,581 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-08 14:39:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:22,586 INFO L225 Difference]: With dead ends: 592 [2021-10-08 14:39:22,586 INFO L226 Difference]: Without dead ends: 562 [2021-10-08 14:39:22,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 78.0ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-08 14:39:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-08 14:39:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-08 14:39:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 2.4563279857397506) internal successors, (1378), 561 states have internal predecessors, (1378), 0 states have call successors, (0), 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-08 14:39:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1378 transitions. [2021-10-08 14:39:22,609 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1378 transitions. Word has length 29 [2021-10-08 14:39:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:22,610 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1378 transitions. [2021-10-08 14:39:22,610 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-08 14:39:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1378 transitions. [2021-10-08 14:39:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:22,613 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:22,613 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-08 14:39:22,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-08 14:39:22,613 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-08 14:39:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash -379621264, now seen corresponding path program 12 times [2021-10-08 14:39:22,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:22,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502435631] [2021-10-08 14:39:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:22,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:22,722 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-08 14:39:22,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:22,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502435631] [2021-10-08 14:39:22,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502435631] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:22,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:22,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:22,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462960927] [2021-10-08 14:39:22,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:22,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:22,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:22,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:22,726 INFO L87 Difference]: Start difference. First operand 562 states and 1378 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-08 14:39:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:22,941 INFO L93 Difference]: Finished difference Result 662 states and 1575 transitions. [2021-10-08 14:39:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-08 14:39:22,942 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-08 14:39:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:22,947 INFO L225 Difference]: With dead ends: 662 [2021-10-08 14:39:22,947 INFO L226 Difference]: Without dead ends: 650 [2021-10-08 14:39:22,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 104.4ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-10-08 14:39:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-10-08 14:39:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 562. [2021-10-08 14:39:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 2.4527629233511585) internal successors, (1376), 561 states have internal predecessors, (1376), 0 states have call successors, (0), 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-08 14:39:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1376 transitions. [2021-10-08 14:39:22,970 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1376 transitions. Word has length 29 [2021-10-08 14:39:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:22,970 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1376 transitions. [2021-10-08 14:39:22,970 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-08 14:39:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1376 transitions. [2021-10-08 14:39:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:22,973 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:22,973 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-08 14:39:22,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-08 14:39:22,973 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-08 14:39:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1508034450, now seen corresponding path program 13 times [2021-10-08 14:39:22,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:22,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061888118] [2021-10-08 14:39:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:22,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:23,081 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-08 14:39:23,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:23,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061888118] [2021-10-08 14:39:23,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061888118] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:23,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:23,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:23,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038729946] [2021-10-08 14:39:23,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:23,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:23,085 INFO L87 Difference]: Start difference. First operand 562 states and 1376 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-08 14:39:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:23,324 INFO L93 Difference]: Finished difference Result 662 states and 1573 transitions. [2021-10-08 14:39:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-08 14:39:23,324 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-08 14:39:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:23,329 INFO L225 Difference]: With dead ends: 662 [2021-10-08 14:39:23,329 INFO L226 Difference]: Without dead ends: 634 [2021-10-08 14:39:23,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 117.3ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-10-08 14:39:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-10-08 14:39:23,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 558. [2021-10-08 14:39:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.4506283662477557) internal successors, (1365), 557 states have internal predecessors, (1365), 0 states have call successors, (0), 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-08 14:39:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1365 transitions. [2021-10-08 14:39:23,351 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1365 transitions. Word has length 29 [2021-10-08 14:39:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:23,352 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1365 transitions. [2021-10-08 14:39:23,352 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-08 14:39:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1365 transitions. [2021-10-08 14:39:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:23,355 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:23,355 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-08 14:39:23,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-08 14:39:23,356 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-08 14:39:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2003154918, now seen corresponding path program 14 times [2021-10-08 14:39:23,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:23,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659407820] [2021-10-08 14:39:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:23,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:23,473 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-08 14:39:23,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:23,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659407820] [2021-10-08 14:39:23,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659407820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:23,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:23,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:23,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699421590] [2021-10-08 14:39:23,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:23,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:23,477 INFO L87 Difference]: Start difference. First operand 558 states and 1365 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-08 14:39:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:23,766 INFO L93 Difference]: Finished difference Result 694 states and 1656 transitions. [2021-10-08 14:39:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-08 14:39:23,766 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-08 14:39:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:23,771 INFO L225 Difference]: With dead ends: 694 [2021-10-08 14:39:23,772 INFO L226 Difference]: Without dead ends: 682 [2021-10-08 14:39:23,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 149.1ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-10-08 14:39:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2021-10-08 14:39:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 558. [2021-10-08 14:39:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.4470377019748653) internal successors, (1363), 557 states have internal predecessors, (1363), 0 states have call successors, (0), 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-08 14:39:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1363 transitions. [2021-10-08 14:39:23,792 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1363 transitions. Word has length 29 [2021-10-08 14:39:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:23,792 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1363 transitions. [2021-10-08 14:39:23,792 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-08 14:39:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1363 transitions. [2021-10-08 14:39:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:23,795 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:23,795 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-08 14:39:23,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-08 14:39:23,795 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-08 14:39:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2028011730, now seen corresponding path program 15 times [2021-10-08 14:39:23,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:23,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487767465] [2021-10-08 14:39:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:23,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:23,907 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-08 14:39:23,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:23,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487767465] [2021-10-08 14:39:23,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487767465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:23,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:23,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:23,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016092604] [2021-10-08 14:39:23,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:23,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:23,909 INFO L87 Difference]: Start difference. First operand 558 states and 1363 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-08 14:39:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:24,216 INFO L93 Difference]: Finished difference Result 624 states and 1516 transitions. [2021-10-08 14:39:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-08 14:39:24,217 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-08 14:39:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:24,221 INFO L225 Difference]: With dead ends: 624 [2021-10-08 14:39:24,221 INFO L226 Difference]: Without dead ends: 612 [2021-10-08 14:39:24,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 170.5ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-08 14:39:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-10-08 14:39:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 556. [2021-10-08 14:39:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 2.4468468468468467) internal successors, (1358), 555 states have internal predecessors, (1358), 0 states have call successors, (0), 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-08 14:39:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1358 transitions. [2021-10-08 14:39:24,239 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1358 transitions. Word has length 29 [2021-10-08 14:39:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:24,239 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 1358 transitions. [2021-10-08 14:39:24,239 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-08 14:39:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1358 transitions. [2021-10-08 14:39:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:24,241 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:24,241 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-08 14:39:24,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-08 14:39:24,242 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-08 14:39:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:24,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1368350754, now seen corresponding path program 16 times [2021-10-08 14:39:24,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:24,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142511813] [2021-10-08 14:39:24,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:24,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 14:39:24,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:24,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142511813] [2021-10-08 14:39:24,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142511813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:24,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:24,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:24,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565607018] [2021-10-08 14:39:24,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:24,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:24,350 INFO L87 Difference]: Start difference. First operand 556 states and 1358 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-08 14:39:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:24,644 INFO L93 Difference]: Finished difference Result 692 states and 1649 transitions. [2021-10-08 14:39:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-08 14:39:24,645 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-08 14:39:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:24,649 INFO L225 Difference]: With dead ends: 692 [2021-10-08 14:39:24,650 INFO L226 Difference]: Without dead ends: 668 [2021-10-08 14:39:24,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 153.1ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-10-08 14:39:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-08 14:39:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 544. [2021-10-08 14:39:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 2.451197053406998) internal successors, (1331), 543 states have internal predecessors, (1331), 0 states have call successors, (0), 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-08 14:39:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1331 transitions. [2021-10-08 14:39:24,668 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1331 transitions. Word has length 29 [2021-10-08 14:39:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:24,669 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1331 transitions. [2021-10-08 14:39:24,669 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-08 14:39:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1331 transitions. [2021-10-08 14:39:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:24,671 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:24,671 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-08 14:39:24,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-08 14:39:24,672 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-08 14:39:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1063817640, now seen corresponding path program 17 times [2021-10-08 14:39:24,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:24,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126543077] [2021-10-08 14:39:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:24,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:24,803 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-08 14:39:24,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:24,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126543077] [2021-10-08 14:39:24,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126543077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:24,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:24,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:24,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512664139] [2021-10-08 14:39:24,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:24,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:24,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:24,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:24,807 INFO L87 Difference]: Start difference. First operand 544 states and 1331 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-08 14:39:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:25,096 INFO L93 Difference]: Finished difference Result 612 states and 1489 transitions. [2021-10-08 14:39:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-08 14:39:25,097 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-08 14:39:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:25,101 INFO L225 Difference]: With dead ends: 612 [2021-10-08 14:39:25,101 INFO L226 Difference]: Without dead ends: 578 [2021-10-08 14:39:25,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 148.1ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-08 14:39:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-10-08 14:39:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 522. [2021-10-08 14:39:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 2.4779270633397315) internal successors, (1291), 521 states have internal predecessors, (1291), 0 states have call successors, (0), 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-08 14:39:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1291 transitions. [2021-10-08 14:39:25,118 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1291 transitions. Word has length 29 [2021-10-08 14:39:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:25,119 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 1291 transitions. [2021-10-08 14:39:25,119 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-08 14:39:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1291 transitions. [2021-10-08 14:39:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:25,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:25,121 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-08 14:39:25,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-08 14:39:25,122 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-08 14:39:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:25,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1021323362, now seen corresponding path program 18 times [2021-10-08 14:39:25,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:25,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507720603] [2021-10-08 14:39:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:25,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:25,203 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-08 14:39:25,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:25,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507720603] [2021-10-08 14:39:25,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507720603] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:25,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:25,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-08 14:39:25,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832636473] [2021-10-08 14:39:25,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-08 14:39:25,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-08 14:39:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-08 14:39:25,207 INFO L87 Difference]: Start difference. First operand 522 states and 1291 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-08 14:39:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:25,351 INFO L93 Difference]: Finished difference Result 404 states and 936 transitions. [2021-10-08 14:39:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-08 14:39:25,352 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-08 14:39:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:25,354 INFO L225 Difference]: With dead ends: 404 [2021-10-08 14:39:25,354 INFO L226 Difference]: Without dead ends: 324 [2021-10-08 14:39:25,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-08 14:39:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-08 14:39:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-10-08 14:39:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.3157894736842106) internal successors, (748), 323 states have internal predecessors, (748), 0 states have call successors, (0), 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-08 14:39:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 748 transitions. [2021-10-08 14:39:25,364 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 748 transitions. Word has length 29 [2021-10-08 14:39:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:25,364 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 748 transitions. [2021-10-08 14:39:25,365 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-08 14:39:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 748 transitions. [2021-10-08 14:39:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:25,366 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:25,366 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-08 14:39:25,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-08 14:39:25,367 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-08 14:39:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash 100174420, now seen corresponding path program 19 times [2021-10-08 14:39:25,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:25,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527968292] [2021-10-08 14:39:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:25,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:25,465 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-08 14:39:25,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:25,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527968292] [2021-10-08 14:39:25,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527968292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:25,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:25,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:25,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363223139] [2021-10-08 14:39:25,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:25,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:25,468 INFO L87 Difference]: Start difference. First operand 324 states and 748 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-08 14:39:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:25,673 INFO L93 Difference]: Finished difference Result 342 states and 775 transitions. [2021-10-08 14:39:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:39:25,674 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-08 14:39:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:25,676 INFO L225 Difference]: With dead ends: 342 [2021-10-08 14:39:25,676 INFO L226 Difference]: Without dead ends: 326 [2021-10-08 14:39:25,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 102.6ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-08 14:39:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2021-10-08 14:39:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.2972136222910216) internal successors, (742), 323 states have internal predecessors, (742), 0 states have call successors, (0), 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-08 14:39:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 742 transitions. [2021-10-08 14:39:25,686 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 742 transitions. Word has length 29 [2021-10-08 14:39:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:25,686 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 742 transitions. [2021-10-08 14:39:25,687 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-08 14:39:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 742 transitions. [2021-10-08 14:39:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:25,695 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:25,695 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-08 14:39:25,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-08 14:39:25,695 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-08 14:39:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1871259744, now seen corresponding path program 20 times [2021-10-08 14:39:25,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:25,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152230136] [2021-10-08 14:39:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:25,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:25,792 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-08 14:39:25,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:25,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152230136] [2021-10-08 14:39:25,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152230136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:25,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:25,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:25,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906274200] [2021-10-08 14:39:25,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:25,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:25,797 INFO L87 Difference]: Start difference. First operand 324 states and 742 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-08 14:39:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:25,997 INFO L93 Difference]: Finished difference Result 372 states and 840 transitions. [2021-10-08 14:39:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:39:25,998 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-08 14:39:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:26,000 INFO L225 Difference]: With dead ends: 372 [2021-10-08 14:39:26,000 INFO L226 Difference]: Without dead ends: 360 [2021-10-08 14:39:26,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 105.3ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:39:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-10-08 14:39:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 326. [2021-10-08 14:39:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.292307692307692) internal successors, (745), 325 states have internal predecessors, (745), 0 states have call successors, (0), 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-08 14:39:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 745 transitions. [2021-10-08 14:39:26,010 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 745 transitions. Word has length 29 [2021-10-08 14:39:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:26,011 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 745 transitions. [2021-10-08 14:39:26,011 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-08 14:39:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 745 transitions. [2021-10-08 14:39:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:26,012 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:26,012 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-08 14:39:26,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-08 14:39:26,013 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-08 14:39:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -558818706, now seen corresponding path program 21 times [2021-10-08 14:39:26,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:26,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560092453] [2021-10-08 14:39:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:26,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:26,112 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-08 14:39:26,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:26,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560092453] [2021-10-08 14:39:26,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560092453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:26,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:26,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:26,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303623476] [2021-10-08 14:39:26,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:26,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:26,115 INFO L87 Difference]: Start difference. First operand 326 states and 745 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-08 14:39:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:26,311 INFO L93 Difference]: Finished difference Result 340 states and 768 transitions. [2021-10-08 14:39:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:39:26,312 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-08 14:39:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:26,314 INFO L225 Difference]: With dead ends: 340 [2021-10-08 14:39:26,314 INFO L226 Difference]: Without dead ends: 322 [2021-10-08 14:39:26,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 114.4ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:39:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-08 14:39:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2021-10-08 14:39:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.2933753943217665) internal successors, (727), 317 states have internal predecessors, (727), 0 states have call successors, (0), 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-08 14:39:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 727 transitions. [2021-10-08 14:39:26,324 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 727 transitions. Word has length 29 [2021-10-08 14:39:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:26,324 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 727 transitions. [2021-10-08 14:39:26,324 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-08 14:39:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 727 transitions. [2021-10-08 14:39:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:26,326 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:26,326 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-08 14:39:26,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-08 14:39:26,326 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-08 14:39:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2036232328, now seen corresponding path program 22 times [2021-10-08 14:39:26,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:26,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072824991] [2021-10-08 14:39:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:26,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:26,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-08 14:39:26,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:26,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072824991] [2021-10-08 14:39:26,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072824991] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:26,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:26,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:26,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937935877] [2021-10-08 14:39:26,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:26,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:26,423 INFO L87 Difference]: Start difference. First operand 318 states and 727 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-08 14:39:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:26,644 INFO L93 Difference]: Finished difference Result 344 states and 768 transitions. [2021-10-08 14:39:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:39:26,644 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-08 14:39:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:26,647 INFO L225 Difference]: With dead ends: 344 [2021-10-08 14:39:26,647 INFO L226 Difference]: Without dead ends: 324 [2021-10-08 14:39:26,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 122.0ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-08 14:39:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-08 14:39:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 312. [2021-10-08 14:39:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.289389067524116) internal successors, (712), 311 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-08 14:39:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 712 transitions. [2021-10-08 14:39:26,656 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 712 transitions. Word has length 29 [2021-10-08 14:39:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:26,656 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 712 transitions. [2021-10-08 14:39:26,656 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-08 14:39:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 712 transitions. [2021-10-08 14:39:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:26,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:26,658 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-08 14:39:26,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-08 14:39:26,658 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-08 14:39:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2043547132, now seen corresponding path program 23 times [2021-10-08 14:39:26,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:26,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338749003] [2021-10-08 14:39:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:26,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:26,749 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-08 14:39:26,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:26,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338749003] [2021-10-08 14:39:26,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338749003] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:26,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:26,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:26,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003432306] [2021-10-08 14:39:26,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:26,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:26,752 INFO L87 Difference]: Start difference. First operand 312 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-08 14:39:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:26,987 INFO L93 Difference]: Finished difference Result 358 states and 805 transitions. [2021-10-08 14:39:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-08 14:39:26,987 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-08 14:39:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:26,990 INFO L225 Difference]: With dead ends: 358 [2021-10-08 14:39:26,990 INFO L226 Difference]: Without dead ends: 340 [2021-10-08 14:39:26,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 129.8ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-10-08 14:39:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-10-08 14:39:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 314. [2021-10-08 14:39:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.2843450479233227) internal successors, (715), 313 states have internal predecessors, (715), 0 states have call successors, (0), 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-08 14:39:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 715 transitions. [2021-10-08 14:39:26,999 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 715 transitions. Word has length 29 [2021-10-08 14:39:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:26,999 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 715 transitions. [2021-10-08 14:39:27,000 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-08 14:39:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 715 transitions. [2021-10-08 14:39:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:27,001 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:27,001 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-08 14:39:27,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-08 14:39:27,001 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-08 14:39:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash 145352174, now seen corresponding path program 24 times [2021-10-08 14:39:27,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:27,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469783622] [2021-10-08 14:39:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:27,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:27,095 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-08 14:39:27,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:27,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469783622] [2021-10-08 14:39:27,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469783622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:27,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:27,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:27,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037261706] [2021-10-08 14:39:27,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:27,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:27,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:27,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:27,098 INFO L87 Difference]: Start difference. First operand 314 states and 715 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-08 14:39:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:27,297 INFO L93 Difference]: Finished difference Result 328 states and 738 transitions. [2021-10-08 14:39:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-08 14:39:27,298 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-08 14:39:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:27,300 INFO L225 Difference]: With dead ends: 328 [2021-10-08 14:39:27,300 INFO L226 Difference]: Without dead ends: 306 [2021-10-08 14:39:27,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 115.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:39:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-08 14:39:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-10-08 14:39:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.2852459016393443) internal successors, (697), 305 states have internal predecessors, (697), 0 states have call successors, (0), 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-08 14:39:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 697 transitions. [2021-10-08 14:39:27,309 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 697 transitions. Word has length 29 [2021-10-08 14:39:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:27,309 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 697 transitions. [2021-10-08 14:39:27,310 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-08 14:39:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 697 transitions. [2021-10-08 14:39:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:27,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:27,311 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-08 14:39:27,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-08 14:39:27,311 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-08 14:39:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1644500820, now seen corresponding path program 25 times [2021-10-08 14:39:27,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:27,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914313863] [2021-10-08 14:39:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:27,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:27,408 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-08 14:39:27,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:27,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914313863] [2021-10-08 14:39:27,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914313863] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:27,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:27,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:27,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551308609] [2021-10-08 14:39:27,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:27,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:27,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:27,411 INFO L87 Difference]: Start difference. First operand 306 states and 697 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-08 14:39:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:27,543 INFO L93 Difference]: Finished difference Result 348 states and 782 transitions. [2021-10-08 14:39:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:39:27,543 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-08 14:39:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:27,545 INFO L225 Difference]: With dead ends: 348 [2021-10-08 14:39:27,545 INFO L226 Difference]: Without dead ends: 336 [2021-10-08 14:39:27,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-10-08 14:39:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-10-08 14:39:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 306. [2021-10-08 14:39:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.278688524590164) internal successors, (695), 305 states have internal predecessors, (695), 0 states have call successors, (0), 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-08 14:39:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 695 transitions. [2021-10-08 14:39:27,554 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 695 transitions. Word has length 29 [2021-10-08 14:39:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:27,554 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 695 transitions. [2021-10-08 14:39:27,554 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-08 14:39:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 695 transitions. [2021-10-08 14:39:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:27,555 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:27,556 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-08 14:39:27,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-08 14:39:27,556 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-08 14:39:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1320490360, now seen corresponding path program 26 times [2021-10-08 14:39:27,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:27,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913683471] [2021-10-08 14:39:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:27,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:27,649 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-08 14:39:27,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:27,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913683471] [2021-10-08 14:39:27,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913683471] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:27,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:27,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:27,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450863788] [2021-10-08 14:39:27,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:27,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:27,652 INFO L87 Difference]: Start difference. First operand 306 states and 695 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-08 14:39:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:27,823 INFO L93 Difference]: Finished difference Result 348 states and 780 transitions. [2021-10-08 14:39:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:39:27,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-08 14:39:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:27,827 INFO L225 Difference]: With dead ends: 348 [2021-10-08 14:39:27,827 INFO L226 Difference]: Without dead ends: 328 [2021-10-08 14:39:27,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-08 14:39:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 304. [2021-10-08 14:39:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.277227722772277) internal successors, (690), 303 states have internal predecessors, (690), 0 states have call successors, (0), 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-08 14:39:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 690 transitions. [2021-10-08 14:39:27,836 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 690 transitions. Word has length 29 [2021-10-08 14:39:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:27,836 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 690 transitions. [2021-10-08 14:39:27,836 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-08 14:39:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 690 transitions. [2021-10-08 14:39:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:27,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:27,837 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-08 14:39:27,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-08 14:39:27,838 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-08 14:39:27,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 780902570, now seen corresponding path program 27 times [2021-10-08 14:39:27,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:27,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064267412] [2021-10-08 14:39:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:27,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:27,926 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-08 14:39:27,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:27,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064267412] [2021-10-08 14:39:27,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064267412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:27,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:27,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:27,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666197629] [2021-10-08 14:39:27,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:27,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:27,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:27,929 INFO L87 Difference]: Start difference. First operand 304 states and 690 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-08 14:39:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:28,081 INFO L93 Difference]: Finished difference Result 312 states and 702 transitions. [2021-10-08 14:39:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:39:28,082 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-08 14:39:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:28,084 INFO L225 Difference]: With dead ends: 312 [2021-10-08 14:39:28,084 INFO L226 Difference]: Without dead ends: 300 [2021-10-08 14:39:28,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 94.8ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-08 14:39:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2021-10-08 14:39:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.274247491638796) internal successors, (680), 299 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-08 14:39:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 680 transitions. [2021-10-08 14:39:28,092 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 680 transitions. Word has length 29 [2021-10-08 14:39:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:28,092 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 680 transitions. [2021-10-08 14:39:28,092 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-08 14:39:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 680 transitions. [2021-10-08 14:39:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:28,093 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:28,094 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-08 14:39:28,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-08 14:39:28,094 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-08 14:39:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1649175880, now seen corresponding path program 28 times [2021-10-08 14:39:28,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:28,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509987364] [2021-10-08 14:39:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:28,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:28,191 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-08 14:39:28,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:28,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509987364] [2021-10-08 14:39:28,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509987364] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:28,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:28,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:28,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401940080] [2021-10-08 14:39:28,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:28,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:28,194 INFO L87 Difference]: Start difference. First operand 300 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-08 14:39:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:28,357 INFO L93 Difference]: Finished difference Result 310 states and 695 transitions. [2021-10-08 14:39:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:39:28,358 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-08 14:39:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:28,360 INFO L225 Difference]: With dead ends: 310 [2021-10-08 14:39:28,360 INFO L226 Difference]: Without dead ends: 298 [2021-10-08 14:39:28,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 111.3ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-08 14:39:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-10-08 14:39:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.272727272727273) internal successors, (675), 297 states have internal predecessors, (675), 0 states have call successors, (0), 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-08 14:39:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 675 transitions. [2021-10-08 14:39:28,369 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 675 transitions. Word has length 29 [2021-10-08 14:39:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:28,370 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 675 transitions. [2021-10-08 14:39:28,370 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-08 14:39:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 675 transitions. [2021-10-08 14:39:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:28,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:28,371 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-08 14:39:28,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-08 14:39:28,372 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-08 14:39:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -997497558, now seen corresponding path program 29 times [2021-10-08 14:39:28,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:28,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190677883] [2021-10-08 14:39:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:28,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:28,465 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-08 14:39:28,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:28,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190677883] [2021-10-08 14:39:28,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190677883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:28,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:28,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:28,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417489410] [2021-10-08 14:39:28,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:28,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:28,468 INFO L87 Difference]: Start difference. First operand 298 states and 675 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-08 14:39:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:28,648 INFO L93 Difference]: Finished difference Result 310 states and 695 transitions. [2021-10-08 14:39:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-08 14:39:28,649 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-08 14:39:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:28,651 INFO L225 Difference]: With dead ends: 310 [2021-10-08 14:39:28,651 INFO L226 Difference]: Without dead ends: 292 [2021-10-08 14:39:28,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 109.6ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-08 14:39:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-10-08 14:39:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-10-08 14:39:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.268041237113402) internal successors, (660), 291 states have internal predecessors, (660), 0 states have call successors, (0), 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-08 14:39:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 660 transitions. [2021-10-08 14:39:28,659 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 660 transitions. Word has length 29 [2021-10-08 14:39:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:28,659 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 660 transitions. [2021-10-08 14:39:28,660 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-08 14:39:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 660 transitions. [2021-10-08 14:39:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:28,661 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:28,661 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-08 14:39:28,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-08 14:39:28,661 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-08 14:39:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1191401748, now seen corresponding path program 30 times [2021-10-08 14:39:28,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:28,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075917775] [2021-10-08 14:39:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:28,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:28,765 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-08 14:39:28,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:28,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075917775] [2021-10-08 14:39:28,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075917775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:28,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:28,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:28,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179789047] [2021-10-08 14:39:28,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:28,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:28,768 INFO L87 Difference]: Start difference. First operand 292 states and 660 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-08 14:39:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:28,918 INFO L93 Difference]: Finished difference Result 274 states and 619 transitions. [2021-10-08 14:39:28,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:39:28,919 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-08 14:39:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:28,921 INFO L225 Difference]: With dead ends: 274 [2021-10-08 14:39:28,921 INFO L226 Difference]: Without dead ends: 250 [2021-10-08 14:39:28,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 108.1ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-10-08 14:39:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-08 14:39:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-10-08 14:39:28,927 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-08 14:39:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 579 transitions. [2021-10-08 14:39:28,928 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 579 transitions. Word has length 29 [2021-10-08 14:39:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:28,928 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 579 transitions. [2021-10-08 14:39:28,928 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-08 14:39:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 579 transitions. [2021-10-08 14:39:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:28,929 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:28,929 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-08 14:39:28,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-08 14:39:28,930 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-08 14:39:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:28,930 INFO L82 PathProgramCache]: Analyzing trace with hash 328426142, now seen corresponding path program 31 times [2021-10-08 14:39:28,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:28,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560811026] [2021-10-08 14:39:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:28,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:29,072 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-08 14:39:29,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:29,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560811026] [2021-10-08 14:39:29,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560811026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:29,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:29,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-08 14:39:29,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578241867] [2021-10-08 14:39:29,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-08 14:39:29,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:29,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-08 14:39:29,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-08 14:39:29,075 INFO L87 Difference]: Start difference. First operand 250 states and 579 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-08 14:39:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:29,212 INFO L93 Difference]: Finished difference Result 298 states and 672 transitions. [2021-10-08 14:39:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-08 14:39:29,213 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-08 14:39:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:29,216 INFO L225 Difference]: With dead ends: 298 [2021-10-08 14:39:29,216 INFO L226 Difference]: Without dead ends: 278 [2021-10-08 14:39:29,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 99.2ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-08 14:39:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-08 14:39:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2021-10-08 14:39:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.2618181818181817) internal successors, (622), 275 states have internal predecessors, (622), 0 states have call successors, (0), 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-08 14:39:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 622 transitions. [2021-10-08 14:39:29,224 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 622 transitions. Word has length 29 [2021-10-08 14:39:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:29,224 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 622 transitions. [2021-10-08 14:39:29,225 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-08 14:39:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 622 transitions. [2021-10-08 14:39:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-08 14:39:29,226 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 14:39:29,226 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-08 14:39:29,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-08 14:39:29,227 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-08 14:39:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 14:39:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -307160290, now seen corresponding path program 32 times [2021-10-08 14:39:29,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 14:39:29,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363097380] [2021-10-08 14:39:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 14:39:29,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 14:39:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 14:39:29,304 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-08 14:39:29,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 14:39:29,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363097380] [2021-10-08 14:39:29,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363097380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 14:39:29,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 14:39:29,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-08 14:39:29,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707214505] [2021-10-08 14:39:29,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-08 14:39:29,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 14:39:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-08 14:39:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-08 14:39:29,308 INFO L87 Difference]: Start difference. First operand 276 states and 622 transitions. Second operand has 6 states, 5 states have (on average 5.8) 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-08 14:39:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 14:39:29,336 INFO L93 Difference]: Finished difference Result 275 states and 621 transitions. [2021-10-08 14:39:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 14:39:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) 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-08 14:39:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 14:39:29,338 INFO L225 Difference]: With dead ends: 275 [2021-10-08 14:39:29,338 INFO L226 Difference]: Without dead ends: 0 [2021-10-08 14:39:29,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-08 14:39:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-08 14:39:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-08 14:39:29,340 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-08 14:39:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-08 14:39:29,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2021-10-08 14:39:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 14:39:29,341 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-08 14:39:29,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) 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-08 14:39:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-08 14:39:29,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-08 14:39:29,344 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-08 14:39:29,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-08 14:39:29,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-08 14:39:29,345 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-08 14:39:29,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-08 14:39:29,351 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-08 14:39:29,351 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-08 14:39:29,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.10 02:39:29 BasicIcfg [2021-10-08 14:39:29,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-08 14:39:29,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-08 14:39:29,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-08 14:39:29,356 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-08 14:39:29,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 02:39:12" (3/4) ... [2021-10-08 14:39:29,360 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-08 14:39:29,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-08 14:39:29,367 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-08 14:39:29,367 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-08 14:39:29,372 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-10-08 14:39:29,372 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-08 14:39:29,372 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-08 14:39:29,372 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-08 14:39:29,410 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-08 14:39:29,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-08 14:39:29,412 INFO L168 Benchmark]: Toolchain (without parser) took 17988.10 ms. Allocated memory was 50.3 MB in the beginning and 134.2 MB in the end (delta: 83.9 MB). Free memory was 26.5 MB in the beginning and 70.2 MB in the end (delta: -43.6 MB). Peak memory consumption was 44.3 MB. Max. memory is 16.1 GB. [2021-10-08 14:39:29,412 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 50.3 MB. Free memory is still 31.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-08 14:39:29,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.60 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 26.0 MB in the beginning and 41.7 MB in the end (delta: -15.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-10-08 14:39:29,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.89 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 39.8 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-08 14:39:29,413 INFO L168 Benchmark]: Boogie Preprocessor took 37.66 ms. Allocated memory is still 62.9 MB. Free memory was 39.8 MB in the beginning and 38.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-08 14:39:29,414 INFO L168 Benchmark]: RCFGBuilder took 727.20 ms. Allocated memory is still 62.9 MB. Free memory was 38.6 MB in the beginning and 40.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 16.1 GB. [2021-10-08 14:39:29,414 INFO L168 Benchmark]: TraceAbstraction took 16724.45 ms. Allocated memory was 62.9 MB in the beginning and 134.2 MB in the end (delta: 71.3 MB). Free memory was 40.0 MB in the beginning and 73.3 MB in the end (delta: -33.3 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. [2021-10-08 14:39:29,415 INFO L168 Benchmark]: Witness Printer took 54.54 ms. Allocated memory is still 134.2 MB. Free memory was 73.3 MB in the beginning and 70.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-08 14:39:29,417 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.43 ms. Allocated memory is still 50.3 MB. Free memory is still 31.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 368.60 ms. Allocated memory was 50.3 MB in the beginning and 62.9 MB in the end (delta: 12.6 MB). Free memory was 26.0 MB in the beginning and 41.7 MB in the end (delta: -15.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.89 ms. Allocated memory is still 62.9 MB. Free memory was 41.7 MB in the beginning and 39.8 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.66 ms. Allocated memory is still 62.9 MB. Free memory was 39.8 MB in the beginning and 38.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 727.20 ms. Allocated memory is still 62.9 MB. Free memory was 38.6 MB in the beginning and 40.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16724.45 ms. Allocated memory was 62.9 MB in the beginning and 134.2 MB in the end (delta: 71.3 MB). Free memory was 40.0 MB in the beginning and 73.3 MB in the end (delta: -33.3 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. * Witness Printer took 54.54 ms. Allocated memory is still 134.2 MB. Free memory was 73.3 MB in the beginning and 70.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4680.6ms, 137 PlacesBefore, 43 PlacesAfterwards, 132 TransitionsBefore, 34 TransitionsAfterwards, 2032 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 4 ChoiceCompositions, 113 TotalNumberOfCompositions, 6055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3153, positive: 2946, positive conditional: 0, positive unconditional: 2946, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1468, positive: 1406, positive conditional: 0, positive unconditional: 1406, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1468, positive: 1385, positive conditional: 0, positive unconditional: 1385, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 127, negative conditional: 0, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3153, positive: 1540, positive conditional: 0, positive unconditional: 1540, negative: 145, negative conditional: 0, negative unconditional: 145, unknown: 1468, unknown conditional: 0, unknown unconditional: 1468] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - 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: 104]: 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, 171 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16499.7ms, OverallIterations: 33, TraceHistogramMax: 1, EmptinessCheckTime: 121.2ms, AutomataDifference: 6381.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4798.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1460 SDtfs, 1757 SDslu, 5977 SDs, 0 SdLazy, 5662 SolverSat, 397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3029.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 3136.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=2, InterpolantAutomatonStates: 385, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 687.4ms AutomataMinimizationTime, 33 MinimizatonAttempts, 816 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 89.1ms SsaConstructionTime, 950.1ms SatisfiabilityAnalysisTime, 3019.2ms InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 4396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-08 14:39:29,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...