./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/lamport.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/lamport.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 1cd4aca3a270639cd11d82d8339f6f913db7e3cc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-03 12:06:47,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-03 12:06:47,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-03 12:06:47,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-03 12:06:47,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-03 12:06:47,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-03 12:06:47,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-03 12:06:47,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-03 12:06:47,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-03 12:06:47,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-03 12:06:47,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-03 12:06:47,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-03 12:06:47,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-03 12:06:47,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-03 12:06:47,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-03 12:06:47,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-03 12:06:47,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-03 12:06:47,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-03 12:06:47,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-03 12:06:47,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-03 12:06:47,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-03 12:06:47,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-03 12:06:47,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-03 12:06:47,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-03 12:06:47,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-03 12:06:47,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-03 12:06:47,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-03 12:06:47,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-03 12:06:47,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-03 12:06:47,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-03 12:06:47,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-03 12:06:47,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-03 12:06:47,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-03 12:06:47,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-03 12:06:47,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-03 12:06:47,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-03 12:06:47,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-03 12:06:47,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-03 12:06:47,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-03 12:06:47,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-03 12:06:47,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-03 12:06:47,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-03 12:06:47,879 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-03 12:06:47,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-03 12:06:47,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-03 12:06:47,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-03 12:06:47,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-03 12:06:47,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-03 12:06:47,883 INFO L138 SettingsManager]: * Use SBE=true [2021-10-03 12:06:47,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-03 12:06:47,884 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-03 12:06:47,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-03 12:06:47,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-03 12:06:47,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-03 12:06:47,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-03 12:06:47,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-03 12:06:47,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-03 12:06:47,886 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-03 12:06:47,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-03 12:06:47,887 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-03 12:06:47,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-03 12:06:47,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-03 12:06:47,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-03 12:06:47,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-03 12:06:47,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 12:06:47,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-03 12:06:47,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-03 12:06:47,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-03 12:06:47,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-03 12:06:47,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-03 12:06:47,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-03 12:06:47,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-03 12:06:47,892 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 -> 1cd4aca3a270639cd11d82d8339f6f913db7e3cc [2021-10-03 12:06:48,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-03 12:06:48,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-03 12:06:48,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-03 12:06:48,423 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-03 12:06:48,425 INFO L275 PluginConnector]: CDTParser initialized [2021-10-03 12:06:48,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-03 12:06:48,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cbef169df/bf42122ea2784030bce658c2a10931ef/FLAGd7e72cda6 [2021-10-03 12:06:49,289 INFO L306 CDTParser]: Found 1 translation units. [2021-10-03 12:06:49,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-03 12:06:49,290 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 12:06:49,291 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 12:06:49,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cbef169df/bf42122ea2784030bce658c2a10931ef/FLAGd7e72cda6 [2021-10-03 12:06:49,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cbef169df/bf42122ea2784030bce658c2a10931ef [2021-10-03 12:06:49,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-03 12:06:49,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-03 12:06:49,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-03 12:06:49,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-03 12:06:49,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-03 12:06:49,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:49,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7429cfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49, skipping insertion in model container [2021-10-03 12:06:49,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:49,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-03 12:06:49,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-03 12:06:49,804 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 12:06:49,873 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/lamport.wvr.c[1729,1742] [2021-10-03 12:06:49,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 12:06:49,896 INFO L203 MainTranslator]: Completed pre-run [2021-10-03 12:06:49,906 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 12:06:49,922 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/lamport.wvr.c[1729,1742] [2021-10-03 12:06:49,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 12:06:49,943 INFO L208 MainTranslator]: Completed translation [2021-10-03 12:06:49,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49 WrapperNode [2021-10-03 12:06:49,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-03 12:06:49,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-03 12:06:49,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-03 12:06:49,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-03 12:06:49,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:49,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:49,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-03 12:06:49,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-03 12:06:49,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-03 12:06:49,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-03 12:06:50,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-03 12:06:50,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-03 12:06:50,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-03 12:06:50,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-03 12:06:50,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (1/1) ... [2021-10-03 12:06:50,068 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 12:06:50,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 12:06:50,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-03 12:06:50,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-03 12:06:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-03 12:06:50,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-03 12:06:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-03 12:06:50,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-03 12:06:50,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-03 12:06:50,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-03 12:06:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-03 12:06:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-03 12:06:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-03 12:06:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-03 12:06:50,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-03 12:06:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-03 12:06:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-03 12:06:50,173 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-03 12:06:50,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-03 12:06:50,696 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-10-03 12:06:50,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:06:50 BoogieIcfgContainer [2021-10-03 12:06:50,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-03 12:06:50,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-03 12:06:50,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-03 12:06:50,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-03 12:06:50,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 12:06:49" (1/3) ... [2021-10-03 12:06:50,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bae84e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:06:50, skipping insertion in model container [2021-10-03 12:06:50,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:06:49" (2/3) ... [2021-10-03 12:06:50,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bae84e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:06:50, skipping insertion in model container [2021-10-03 12:06:50,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:06:50" (3/3) ... [2021-10-03 12:06:50,711 INFO L111 eAbstractionObserver]: Analyzing ICFG lamport.wvr.c [2021-10-03 12:06:50,718 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-03 12:06:50,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-03 12:06:50,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-03 12:06:50,719 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-03 12:06:50,775 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,776 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,776 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,776 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,777 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,777 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,777 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,777 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,778 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,778 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,778 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,779 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,779 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,779 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,780 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,780 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,780 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,780 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,781 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,781 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,781 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,782 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,782 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,782 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,783 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,783 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,783 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,783 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,784 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,784 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,784 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,785 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,785 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,785 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,786 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,786 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,786 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,786 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,787 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,787 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,787 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,788 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,788 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,788 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,789 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,789 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,790 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,790 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,791 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,791 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,791 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,792 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,792 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,792 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,793 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,793 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,793 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,793 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,794 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,794 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,795 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,795 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,795 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,795 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,796 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,796 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,796 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,797 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,797 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,797 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,798 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,798 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,798 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,799 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,799 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,799 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,800 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,800 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,800 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,801 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,801 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,801 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,801 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,802 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,802 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,802 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,803 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,803 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,803 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,803 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,804 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,804 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,805 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,805 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,805 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,806 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,806 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,806 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,807 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,807 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,807 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,808 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,808 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,808 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,808 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,809 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,809 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,809 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,810 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,810 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,810 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,812 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,812 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,812 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,813 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,813 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,817 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,818 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,819 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,825 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,825 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,827 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,827 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 12:06:50,838 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-03 12:06:50,899 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-03 12:06:50,908 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-03 12:06:50,908 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-03 12:06:50,931 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-03 12:06:50,946 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 200 transitions, 424 flow [2021-10-03 12:06:50,950 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 200 transitions, 424 flow [2021-10-03 12:06:50,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 200 transitions, 424 flow [2021-10-03 12:06:51,082 INFO L129 PetriNetUnfolder]: 13/197 cut-off events. [2021-10-03 12:06:51,082 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-03 12:06:51,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 13/197 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2021-10-03 12:06:51,103 INFO L116 LiptonReduction]: Number of co-enabled transitions 5124 [2021-10-03 12:06:57,278 INFO L131 LiptonReduction]: Checked pairs total: 18150 [2021-10-03 12:06:57,279 INFO L133 LiptonReduction]: Total number of compositions: 210 [2021-10-03 12:06:57,288 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 116 flow [2021-10-03 12:06:57,365 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-03 12:06:57,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:06:57,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:06:57,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:06:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:06:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1531429469, now seen corresponding path program 1 times [2021-10-03 12:06:57,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:06:57,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941694132] [2021-10-03 12:06:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:06:57,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:06:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:06:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:06:57,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:06:57,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941694132] [2021-10-03 12:06:57,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941694132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:06:57,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:06:57,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-03 12:06:57,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915870447] [2021-10-03 12:06:57,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-03 12:06:57,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:06:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-03 12:06:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-03 12:06:57,692 INFO L87 Difference]: Start difference. First operand has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:06:57,764 INFO L93 Difference]: Finished difference Result 945 states and 2622 transitions. [2021-10-03 12:06:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-03 12:06:57,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-03 12:06:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:06:57,794 INFO L225 Difference]: With dead ends: 945 [2021-10-03 12:06:57,795 INFO L226 Difference]: Without dead ends: 945 [2021-10-03 12:06:57,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-03 12:06:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-10-03 12:06:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-10-03 12:06:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.777542372881356) internal successors, (2622), 944 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2622 transitions. [2021-10-03 12:06:57,918 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2622 transitions. Word has length 19 [2021-10-03 12:06:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:06:57,919 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2622 transitions. [2021-10-03 12:06:57,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2622 transitions. [2021-10-03 12:06:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:06:57,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:06:57,926 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:06:57,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-03 12:06:57,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:06:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:06:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 647006068, now seen corresponding path program 1 times [2021-10-03 12:06:57,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:06:57,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785378551] [2021-10-03 12:06:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:06:57,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:06:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:06:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:06:58,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:06:58,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785378551] [2021-10-03 12:06:58,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785378551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:06:58,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:06:58,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:06:58,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767515836] [2021-10-03 12:06:58,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:06:58,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:06:58,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:06:58,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:06:58,464 INFO L87 Difference]: Start difference. First operand 945 states and 2622 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:06:59,110 INFO L93 Difference]: Finished difference Result 1378 states and 3726 transitions. [2021-10-03 12:06:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:06:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:06:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:06:59,122 INFO L225 Difference]: With dead ends: 1378 [2021-10-03 12:06:59,123 INFO L226 Difference]: Without dead ends: 1279 [2021-10-03 12:06:59,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 231.5ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:06:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2021-10-03 12:06:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1075. [2021-10-03 12:06:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1074 states have (on average 2.7476722532588456) internal successors, (2951), 1074 states have internal predecessors, (2951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2951 transitions. [2021-10-03 12:06:59,176 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2951 transitions. Word has length 37 [2021-10-03 12:06:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:06:59,177 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 2951 transitions. [2021-10-03 12:06:59,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:06:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2951 transitions. [2021-10-03 12:06:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:06:59,184 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:06:59,184 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:06:59,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-03 12:06:59,185 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:06:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:06:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2075511054, now seen corresponding path program 2 times [2021-10-03 12:06:59,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:06:59,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575526058] [2021-10-03 12:06:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:06:59,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:06:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:06:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:06:59,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:06:59,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575526058] [2021-10-03 12:06:59,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575526058] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:06:59,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:06:59,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:06:59,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589408266] [2021-10-03 12:06:59,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:06:59,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:06:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:06:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:06:59,514 INFO L87 Difference]: Start difference. First operand 1075 states and 2951 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:00,002 INFO L93 Difference]: Finished difference Result 1334 states and 3631 transitions. [2021-10-03 12:07:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:07:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:00,014 INFO L225 Difference]: With dead ends: 1334 [2021-10-03 12:07:00,014 INFO L226 Difference]: Without dead ends: 1263 [2021-10-03 12:07:00,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 224.6ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:07:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2021-10-03 12:07:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1103. [2021-10-03 12:07:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 2.7395644283121596) internal successors, (3019), 1102 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3019 transitions. [2021-10-03 12:07:00,075 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 3019 transitions. Word has length 37 [2021-10-03 12:07:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:00,076 INFO L470 AbstractCegarLoop]: Abstraction has 1103 states and 3019 transitions. [2021-10-03 12:07:00,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 3019 transitions. [2021-10-03 12:07:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:00,084 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:00,085 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:00,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-03 12:07:00,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash -339122262, now seen corresponding path program 3 times [2021-10-03 12:07:00,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:00,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222496088] [2021-10-03 12:07:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:00,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:00,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:00,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222496088] [2021-10-03 12:07:00,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222496088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:00,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:00,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:00,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520866060] [2021-10-03 12:07:00,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:00,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:00,373 INFO L87 Difference]: Start difference. First operand 1103 states and 3019 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:00,889 INFO L93 Difference]: Finished difference Result 1298 states and 3521 transitions. [2021-10-03 12:07:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:00,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:00,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:00,901 INFO L225 Difference]: With dead ends: 1298 [2021-10-03 12:07:00,901 INFO L226 Difference]: Without dead ends: 1249 [2021-10-03 12:07:00,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 219.5ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:07:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2021-10-03 12:07:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1089. [2021-10-03 12:07:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 2.7371323529411766) internal successors, (2978), 1088 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 2978 transitions. [2021-10-03 12:07:00,952 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 2978 transitions. Word has length 37 [2021-10-03 12:07:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:00,953 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 2978 transitions. [2021-10-03 12:07:00,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 2978 transitions. [2021-10-03 12:07:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:00,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:00,958 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:00,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-03 12:07:00,959 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:00,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1600942060, now seen corresponding path program 4 times [2021-10-03 12:07:00,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:00,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449384377] [2021-10-03 12:07:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:00,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:01,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:01,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449384377] [2021-10-03 12:07:01,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449384377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:01,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:01,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:01,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679699977] [2021-10-03 12:07:01,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:01,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:01,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:01,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:01,158 INFO L87 Difference]: Start difference. First operand 1089 states and 2978 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:01,609 INFO L93 Difference]: Finished difference Result 1292 states and 3497 transitions. [2021-10-03 12:07:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:01,624 INFO L225 Difference]: With dead ends: 1292 [2021-10-03 12:07:01,625 INFO L226 Difference]: Without dead ends: 1134 [2021-10-03 12:07:01,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 206.9ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:07:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2021-10-03 12:07:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 974. [2021-10-03 12:07:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 2.760534429599178) internal successors, (2686), 973 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2686 transitions. [2021-10-03 12:07:01,692 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2686 transitions. Word has length 37 [2021-10-03 12:07:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:01,693 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 2686 transitions. [2021-10-03 12:07:01,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2686 transitions. [2021-10-03 12:07:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:01,698 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:01,698 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:01,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-03 12:07:01,699 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2079251778, now seen corresponding path program 5 times [2021-10-03 12:07:01,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:01,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975601811] [2021-10-03 12:07:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:01,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:01,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:01,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975601811] [2021-10-03 12:07:01,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975601811] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:01,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:01,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:07:01,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842091961] [2021-10-03 12:07:01,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:07:01,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:01,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:07:01,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:07:01,992 INFO L87 Difference]: Start difference. First operand 974 states and 2686 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:02,472 INFO L93 Difference]: Finished difference Result 1229 states and 3268 transitions. [2021-10-03 12:07:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:02,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:02,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:02,482 INFO L225 Difference]: With dead ends: 1229 [2021-10-03 12:07:02,482 INFO L226 Difference]: Without dead ends: 1130 [2021-10-03 12:07:02,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 200.9ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:07:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-10-03 12:07:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 988. [2021-10-03 12:07:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 2.7426545086119556) internal successors, (2707), 987 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2707 transitions. [2021-10-03 12:07:02,524 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2707 transitions. Word has length 37 [2021-10-03 12:07:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:02,524 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 2707 transitions. [2021-10-03 12:07:02,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2707 transitions. [2021-10-03 12:07:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:02,529 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:02,529 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:02,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-03 12:07:02,530 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1143406056, now seen corresponding path program 6 times [2021-10-03 12:07:02,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:02,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758136765] [2021-10-03 12:07:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:02,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:02,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:02,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758136765] [2021-10-03 12:07:02,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758136765] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:02,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:02,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:02,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041311925] [2021-10-03 12:07:02,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:07:02,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:07:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:07:02,622 INFO L87 Difference]: Start difference. First operand 988 states and 2707 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:02,778 INFO L93 Difference]: Finished difference Result 1742 states and 4682 transitions. [2021-10-03 12:07:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:07:02,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:02,792 INFO L225 Difference]: With dead ends: 1742 [2021-10-03 12:07:02,792 INFO L226 Difference]: Without dead ends: 1641 [2021-10-03 12:07:02,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:07:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2021-10-03 12:07:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1107. [2021-10-03 12:07:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 2.7034358047016274) internal successors, (2990), 1106 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2990 transitions. [2021-10-03 12:07:02,854 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 2990 transitions. Word has length 37 [2021-10-03 12:07:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:02,855 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 2990 transitions. [2021-10-03 12:07:02,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2990 transitions. [2021-10-03 12:07:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:02,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:02,860 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:02,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-03 12:07:02,860 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash -187082926, now seen corresponding path program 7 times [2021-10-03 12:07:02,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:02,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558637002] [2021-10-03 12:07:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:02,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:02,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:02,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558637002] [2021-10-03 12:07:02,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558637002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:02,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:02,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:02,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573477279] [2021-10-03 12:07:02,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:02,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:02,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:02,988 INFO L87 Difference]: Start difference. First operand 1107 states and 2990 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:03,311 INFO L93 Difference]: Finished difference Result 1516 states and 3878 transitions. [2021-10-03 12:07:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:03,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:03,323 INFO L225 Difference]: With dead ends: 1516 [2021-10-03 12:07:03,323 INFO L226 Difference]: Without dead ends: 1352 [2021-10-03 12:07:03,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 124.3ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-10-03 12:07:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1092. [2021-10-03 12:07:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 2.692942254812099) internal successors, (2938), 1091 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2938 transitions. [2021-10-03 12:07:03,370 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2938 transitions. Word has length 37 [2021-10-03 12:07:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:03,371 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 2938 transitions. [2021-10-03 12:07:03,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2938 transitions. [2021-10-03 12:07:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:03,376 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:03,377 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:03,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-03 12:07:03,377 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2046962072, now seen corresponding path program 8 times [2021-10-03 12:07:03,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:03,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989441074] [2021-10-03 12:07:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:03,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:03,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:03,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989441074] [2021-10-03 12:07:03,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989441074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:03,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:03,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:03,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400496990] [2021-10-03 12:07:03,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:03,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:03,540 INFO L87 Difference]: Start difference. First operand 1092 states and 2938 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:03,832 INFO L93 Difference]: Finished difference Result 1291 states and 3325 transitions. [2021-10-03 12:07:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:07:03,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:03,840 INFO L225 Difference]: With dead ends: 1291 [2021-10-03 12:07:03,841 INFO L226 Difference]: Without dead ends: 1004 [2021-10-03 12:07:03,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 112.8ms TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:07:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-10-03 12:07:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 892. [2021-10-03 12:07:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.695847362514029) internal successors, (2402), 891 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2402 transitions. [2021-10-03 12:07:03,871 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2402 transitions. Word has length 37 [2021-10-03 12:07:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:03,871 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 2402 transitions. [2021-10-03 12:07:03,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2402 transitions. [2021-10-03 12:07:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:03,875 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:03,875 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:03,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-03 12:07:03,876 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1728740606, now seen corresponding path program 9 times [2021-10-03 12:07:03,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:03,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119430240] [2021-10-03 12:07:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:03,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:04,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:04,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119430240] [2021-10-03 12:07:04,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119430240] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:04,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:04,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:04,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471414993] [2021-10-03 12:07:04,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:04,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:04,088 INFO L87 Difference]: Start difference. First operand 892 states and 2402 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:04,578 INFO L93 Difference]: Finished difference Result 1123 states and 2918 transitions. [2021-10-03 12:07:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:04,587 INFO L225 Difference]: With dead ends: 1123 [2021-10-03 12:07:04,587 INFO L226 Difference]: Without dead ends: 1048 [2021-10-03 12:07:04,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 240.7ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:07:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-10-03 12:07:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 892. [2021-10-03 12:07:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.6374859708193044) internal successors, (2350), 891 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2350 transitions. [2021-10-03 12:07:04,619 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2350 transitions. Word has length 37 [2021-10-03 12:07:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:04,620 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 2350 transitions. [2021-10-03 12:07:04,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2350 transitions. [2021-10-03 12:07:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:04,623 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:04,623 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:04,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-03 12:07:04,624 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:04,625 INFO L82 PathProgramCache]: Analyzing trace with hash -156290432, now seen corresponding path program 10 times [2021-10-03 12:07:04,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:04,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027002985] [2021-10-03 12:07:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:04,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:04,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:04,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027002985] [2021-10-03 12:07:04,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027002985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:04,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:04,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:04,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791968635] [2021-10-03 12:07:04,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:04,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:04,841 INFO L87 Difference]: Start difference. First operand 892 states and 2350 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:05,331 INFO L93 Difference]: Finished difference Result 1051 states and 2739 transitions. [2021-10-03 12:07:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:07:05,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:05,339 INFO L225 Difference]: With dead ends: 1051 [2021-10-03 12:07:05,339 INFO L226 Difference]: Without dead ends: 1016 [2021-10-03 12:07:05,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 265.8ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-03 12:07:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-10-03 12:07:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 904. [2021-10-03 12:07:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 2.629014396456257) internal successors, (2374), 903 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-03 12:07:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 2374 transitions. [2021-10-03 12:07:05,371 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 2374 transitions. Word has length 37 [2021-10-03 12:07:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:05,371 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 2374 transitions. [2021-10-03 12:07:05,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 2374 transitions. [2021-10-03 12:07:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:05,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:05,375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:05,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-03 12:07:05,376 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1580098360, now seen corresponding path program 11 times [2021-10-03 12:07:05,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:05,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145910714] [2021-10-03 12:07:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:05,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:05,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:05,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145910714] [2021-10-03 12:07:05,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145910714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:05,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:05,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:05,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767043462] [2021-10-03 12:07:05,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:05,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:05,567 INFO L87 Difference]: Start difference. First operand 904 states and 2374 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:06,053 INFO L93 Difference]: Finished difference Result 1035 states and 2697 transitions. [2021-10-03 12:07:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:06,054 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:06,065 INFO L225 Difference]: With dead ends: 1035 [2021-10-03 12:07:06,065 INFO L226 Difference]: Without dead ends: 1010 [2021-10-03 12:07:06,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 234.2ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:07:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-10-03 12:07:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 898. [2021-10-03 12:07:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 2.629877369007804) internal successors, (2359), 897 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 2359 transitions. [2021-10-03 12:07:06,105 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 2359 transitions. Word has length 37 [2021-10-03 12:07:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:06,106 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 2359 transitions. [2021-10-03 12:07:06,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 2359 transitions. [2021-10-03 12:07:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:06,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:06,110 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:06,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-03 12:07:06,111 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash 318278562, now seen corresponding path program 12 times [2021-10-03 12:07:06,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:06,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513153702] [2021-10-03 12:07:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:06,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:06,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:06,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513153702] [2021-10-03 12:07:06,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513153702] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:06,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:06,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:06,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454458044] [2021-10-03 12:07:06,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:06,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:06,340 INFO L87 Difference]: Start difference. First operand 898 states and 2359 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:06,753 INFO L93 Difference]: Finished difference Result 1033 states and 2689 transitions. [2021-10-03 12:07:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:06,760 INFO L225 Difference]: With dead ends: 1033 [2021-10-03 12:07:06,760 INFO L226 Difference]: Without dead ends: 908 [2021-10-03 12:07:06,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 253.7ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-10-03 12:07:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-10-03 12:07:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 796. [2021-10-03 12:07:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.657861635220126) internal successors, (2113), 795 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2113 transitions. [2021-10-03 12:07:06,790 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2113 transitions. Word has length 37 [2021-10-03 12:07:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:06,790 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2113 transitions. [2021-10-03 12:07:06,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2113 transitions. [2021-10-03 12:07:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:06,794 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:06,794 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:06,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-03 12:07:06,795 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1149400592, now seen corresponding path program 13 times [2021-10-03 12:07:06,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:06,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338025729] [2021-10-03 12:07:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:06,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:07,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:07,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338025729] [2021-10-03 12:07:07,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338025729] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:07,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:07,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:07:07,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177949140] [2021-10-03 12:07:07,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:07:07,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:07,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:07:07,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:07:07,003 INFO L87 Difference]: Start difference. First operand 796 states and 2113 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:07,439 INFO L93 Difference]: Finished difference Result 951 states and 2449 transitions. [2021-10-03 12:07:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-03 12:07:07,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:07,445 INFO L225 Difference]: With dead ends: 951 [2021-10-03 12:07:07,445 INFO L226 Difference]: Without dead ends: 833 [2021-10-03 12:07:07,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 246.6ms TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2021-10-03 12:07:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-10-03 12:07:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 701. [2021-10-03 12:07:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 2.7457142857142856) internal successors, (1922), 700 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1922 transitions. [2021-10-03 12:07:07,466 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1922 transitions. Word has length 37 [2021-10-03 12:07:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:07,466 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1922 transitions. [2021-10-03 12:07:07,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1922 transitions. [2021-10-03 12:07:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:07,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:07,469 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:07,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-03 12:07:07,470 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -983753494, now seen corresponding path program 14 times [2021-10-03 12:07:07,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:07,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253241107] [2021-10-03 12:07:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:07,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:07,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:07,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253241107] [2021-10-03 12:07:07,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253241107] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:07,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:07,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:07,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225464722] [2021-10-03 12:07:07,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:07:07,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:07:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:07:07,562 INFO L87 Difference]: Start difference. First operand 701 states and 1922 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:07,718 INFO L93 Difference]: Finished difference Result 1679 states and 4612 transitions. [2021-10-03 12:07:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:07,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:07,754 INFO L225 Difference]: With dead ends: 1679 [2021-10-03 12:07:07,754 INFO L226 Difference]: Without dead ends: 1535 [2021-10-03 12:07:07,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 93.5ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-03 12:07:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2021-10-03 12:07:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 725. [2021-10-03 12:07:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 2.729281767955801) internal successors, (1976), 724 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1976 transitions. [2021-10-03 12:07:07,800 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1976 transitions. Word has length 37 [2021-10-03 12:07:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:07,801 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1976 transitions. [2021-10-03 12:07:07,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1976 transitions. [2021-10-03 12:07:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:07,804 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:07,804 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:07,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-03 12:07:07,805 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:07,805 INFO L82 PathProgramCache]: Analyzing trace with hash 751046400, now seen corresponding path program 15 times [2021-10-03 12:07:07,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:07,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360583866] [2021-10-03 12:07:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:07,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:07,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:07,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360583866] [2021-10-03 12:07:07,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360583866] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:07,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:07,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 12:07:07,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007308894] [2021-10-03 12:07:07,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 12:07:07,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 12:07:07,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-03 12:07:07,895 INFO L87 Difference]: Start difference. First operand 725 states and 1976 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:07,923 INFO L93 Difference]: Finished difference Result 773 states and 2060 transitions. [2021-10-03 12:07:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-03 12:07:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:07,926 INFO L225 Difference]: With dead ends: 773 [2021-10-03 12:07:07,927 INFO L226 Difference]: Without dead ends: 707 [2021-10-03 12:07:07,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-03 12:07:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-10-03 12:07:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2021-10-03 12:07:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 2.7138810198300285) internal successors, (1916), 706 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1916 transitions. [2021-10-03 12:07:07,948 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1916 transitions. Word has length 37 [2021-10-03 12:07:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:07,948 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 1916 transitions. [2021-10-03 12:07:07,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1916 transitions. [2021-10-03 12:07:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:07,951 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:07,951 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:07,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-03 12:07:07,952 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:07,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1297468664, now seen corresponding path program 16 times [2021-10-03 12:07:07,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:07,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704830430] [2021-10-03 12:07:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:07,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:08,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:08,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704830430] [2021-10-03 12:07:08,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704830430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:08,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:08,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:08,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456724029] [2021-10-03 12:07:08,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:07:08,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:07:08,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:07:08,059 INFO L87 Difference]: Start difference. First operand 707 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:08,160 INFO L93 Difference]: Finished difference Result 887 states and 2384 transitions. [2021-10-03 12:07:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 12:07:08,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:08,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:08,163 INFO L225 Difference]: With dead ends: 887 [2021-10-03 12:07:08,163 INFO L226 Difference]: Without dead ends: 699 [2021-10-03 12:07:08,164 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.5ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:07:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-03 12:07:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 687. [2021-10-03 12:07:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 2.717201166180758) internal successors, (1864), 686 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1864 transitions. [2021-10-03 12:07:08,183 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1864 transitions. Word has length 37 [2021-10-03 12:07:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:08,183 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1864 transitions. [2021-10-03 12:07:08,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1864 transitions. [2021-10-03 12:07:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:08,186 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:08,186 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:08,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-03 12:07:08,186 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:08,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:08,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2104381174, now seen corresponding path program 17 times [2021-10-03 12:07:08,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:08,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019364384] [2021-10-03 12:07:08,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:08,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:08,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:08,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019364384] [2021-10-03 12:07:08,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019364384] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:08,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:08,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:08,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541732383] [2021-10-03 12:07:08,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:07:08,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:07:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:07:08,267 INFO L87 Difference]: Start difference. First operand 687 states and 1864 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:08,384 INFO L93 Difference]: Finished difference Result 855 states and 2308 transitions. [2021-10-03 12:07:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-03 12:07:08,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:08,387 INFO L225 Difference]: With dead ends: 855 [2021-10-03 12:07:08,387 INFO L226 Difference]: Without dead ends: 855 [2021-10-03 12:07:08,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:07:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-10-03 12:07:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2021-10-03 12:07:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 2.702576112412178) internal successors, (2308), 854 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2308 transitions. [2021-10-03 12:07:08,411 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2308 transitions. Word has length 37 [2021-10-03 12:07:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:08,412 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 2308 transitions. [2021-10-03 12:07:08,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2308 transitions. [2021-10-03 12:07:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:08,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:08,416 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:08,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-03 12:07:08,416 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash -669127736, now seen corresponding path program 18 times [2021-10-03 12:07:08,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:08,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299441589] [2021-10-03 12:07:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:08,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:08,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:08,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299441589] [2021-10-03 12:07:08,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299441589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:08,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:08,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-03 12:07:08,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917121477] [2021-10-03 12:07:08,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:08,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:08,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:08,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:08,528 INFO L87 Difference]: Start difference. First operand 855 states and 2308 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:08,650 INFO L93 Difference]: Finished difference Result 861 states and 2314 transitions. [2021-10-03 12:07:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:07:08,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:08,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:08,653 INFO L225 Difference]: With dead ends: 861 [2021-10-03 12:07:08,653 INFO L226 Difference]: Without dead ends: 807 [2021-10-03 12:07:08,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 95.8ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-03 12:07:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-10-03 12:07:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.684863523573201) internal successors, (2164), 806 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2164 transitions. [2021-10-03 12:07:08,679 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2164 transitions. Word has length 37 [2021-10-03 12:07:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:08,679 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 2164 transitions. [2021-10-03 12:07:08,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2164 transitions. [2021-10-03 12:07:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:08,683 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:08,683 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:08,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-03 12:07:08,684 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash -401888728, now seen corresponding path program 19 times [2021-10-03 12:07:08,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:08,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105423734] [2021-10-03 12:07:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:08,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:08,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:08,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105423734] [2021-10-03 12:07:08,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105423734] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:08,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:08,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:08,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993265379] [2021-10-03 12:07:08,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:08,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:08,789 INFO L87 Difference]: Start difference. First operand 807 states and 2164 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:09,139 INFO L93 Difference]: Finished difference Result 1024 states and 2603 transitions. [2021-10-03 12:07:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-03 12:07:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:09,142 INFO L225 Difference]: With dead ends: 1024 [2021-10-03 12:07:09,142 INFO L226 Difference]: Without dead ends: 863 [2021-10-03 12:07:09,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 152.4ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-03 12:07:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-10-03 12:07:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 771. [2021-10-03 12:07:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 2.6363636363636362) internal successors, (2030), 770 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-03 12:07:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2030 transitions. [2021-10-03 12:07:09,166 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2030 transitions. Word has length 37 [2021-10-03 12:07:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:09,166 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 2030 transitions. [2021-10-03 12:07:09,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2030 transitions. [2021-10-03 12:07:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:09,168 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:09,169 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:09,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-03 12:07:09,169 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash -3847976, now seen corresponding path program 20 times [2021-10-03 12:07:09,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:09,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668296684] [2021-10-03 12:07:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:09,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:09,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:09,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668296684] [2021-10-03 12:07:09,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668296684] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:09,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:09,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:09,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868731737] [2021-10-03 12:07:09,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:07:09,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:09,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:07:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:07:09,254 INFO L87 Difference]: Start difference. First operand 771 states and 2030 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:09,368 INFO L93 Difference]: Finished difference Result 977 states and 2490 transitions. [2021-10-03 12:07:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 12:07:09,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:09,370 INFO L225 Difference]: With dead ends: 977 [2021-10-03 12:07:09,370 INFO L226 Difference]: Without dead ends: 833 [2021-10-03 12:07:09,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-03 12:07:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-10-03 12:07:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 759. [2021-10-03 12:07:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 2.6306068601583115) internal successors, (1994), 758 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1994 transitions. [2021-10-03 12:07:09,391 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1994 transitions. Word has length 37 [2021-10-03 12:07:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:09,392 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1994 transitions. [2021-10-03 12:07:09,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1994 transitions. [2021-10-03 12:07:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:09,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:09,404 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-03 12:07:09,404 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash -317563146, now seen corresponding path program 21 times [2021-10-03 12:07:09,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:09,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236198273] [2021-10-03 12:07:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:09,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:09,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:09,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236198273] [2021-10-03 12:07:09,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236198273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:09,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:09,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:09,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162784248] [2021-10-03 12:07:09,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 12:07:09,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 12:07:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-03 12:07:09,500 INFO L87 Difference]: Start difference. First operand 759 states and 1994 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:09,600 INFO L93 Difference]: Finished difference Result 539 states and 1348 transitions. [2021-10-03 12:07:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-03 12:07:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:09,601 INFO L225 Difference]: With dead ends: 539 [2021-10-03 12:07:09,602 INFO L226 Difference]: Without dead ends: 353 [2021-10-03 12:07:09,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:07:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-03 12:07:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2021-10-03 12:07:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.4431818181818183) internal successors, (860), 352 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 860 transitions. [2021-10-03 12:07:09,611 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 860 transitions. Word has length 37 [2021-10-03 12:07:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:09,611 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 860 transitions. [2021-10-03 12:07:09,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 860 transitions. [2021-10-03 12:07:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:09,612 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:09,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:09,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-03 12:07:09,613 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash 230980286, now seen corresponding path program 22 times [2021-10-03 12:07:09,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:09,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300671276] [2021-10-03 12:07:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:09,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:09,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:09,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300671276] [2021-10-03 12:07:09,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300671276] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:09,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:09,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:09,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477874394] [2021-10-03 12:07:09,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:09,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:09,711 INFO L87 Difference]: Start difference. First operand 353 states and 860 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:09,913 INFO L93 Difference]: Finished difference Result 491 states and 1195 transitions. [2021-10-03 12:07:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:09,916 INFO L225 Difference]: With dead ends: 491 [2021-10-03 12:07:09,916 INFO L226 Difference]: Without dead ends: 438 [2021-10-03 12:07:09,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 88.6ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-03 12:07:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2021-10-03 12:07:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.440281030444965) internal successors, (1042), 427 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1042 transitions. [2021-10-03 12:07:09,927 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1042 transitions. Word has length 37 [2021-10-03 12:07:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:09,927 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1042 transitions. [2021-10-03 12:07:09,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1042 transitions. [2021-10-03 12:07:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:09,929 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:09,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:09,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-03 12:07:09,929 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1648917944, now seen corresponding path program 23 times [2021-10-03 12:07:09,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:09,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911424489] [2021-10-03 12:07:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:09,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:10,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:10,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911424489] [2021-10-03 12:07:10,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911424489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:10,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:10,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:10,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15387583] [2021-10-03 12:07:10,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:10,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:10,042 INFO L87 Difference]: Start difference. First operand 428 states and 1042 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:10,271 INFO L93 Difference]: Finished difference Result 460 states and 1097 transitions. [2021-10-03 12:07:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:10,273 INFO L225 Difference]: With dead ends: 460 [2021-10-03 12:07:10,273 INFO L226 Difference]: Without dead ends: 447 [2021-10-03 12:07:10,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 99.8ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-10-03 12:07:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 434. [2021-10-03 12:07:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.4341801385681294) internal successors, (1054), 433 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1054 transitions. [2021-10-03 12:07:10,285 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1054 transitions. Word has length 37 [2021-10-03 12:07:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:10,285 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1054 transitions. [2021-10-03 12:07:10,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1054 transitions. [2021-10-03 12:07:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:10,287 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:10,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:10,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-03 12:07:10,287 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1262017724, now seen corresponding path program 24 times [2021-10-03 12:07:10,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:10,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855839017] [2021-10-03 12:07:10,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:10,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:10,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:10,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855839017] [2021-10-03 12:07:10,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855839017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:10,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:10,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:10,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116810036] [2021-10-03 12:07:10,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:10,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:10,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:10,407 INFO L87 Difference]: Start difference. First operand 434 states and 1054 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:10,636 INFO L93 Difference]: Finished difference Result 458 states and 1092 transitions. [2021-10-03 12:07:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:07:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:10,638 INFO L225 Difference]: With dead ends: 458 [2021-10-03 12:07:10,638 INFO L226 Difference]: Without dead ends: 431 [2021-10-03 12:07:10,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 106.0ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-10-03 12:07:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-10-03 12:07:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 2.432558139534884) internal successors, (1046), 430 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1046 transitions. [2021-10-03 12:07:10,649 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1046 transitions. Word has length 37 [2021-10-03 12:07:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:10,650 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 1046 transitions. [2021-10-03 12:07:10,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1046 transitions. [2021-10-03 12:07:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:10,651 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:10,652 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:10,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-03 12:07:10,652 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2049943436, now seen corresponding path program 25 times [2021-10-03 12:07:10,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:10,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616640762] [2021-10-03 12:07:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:10,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:10,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:10,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616640762] [2021-10-03 12:07:10,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616640762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:10,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:10,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:10,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480510752] [2021-10-03 12:07:10,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:10,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:10,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:10,757 INFO L87 Difference]: Start difference. First operand 431 states and 1046 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:10,998 INFO L93 Difference]: Finished difference Result 446 states and 1064 transitions. [2021-10-03 12:07:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:07:10,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:11,001 INFO L225 Difference]: With dead ends: 446 [2021-10-03 12:07:11,001 INFO L226 Difference]: Without dead ends: 371 [2021-10-03 12:07:11,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 114.1ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-10-03 12:07:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-03 12:07:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2021-10-03 12:07:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 2.4297297297297296) internal successors, (899), 370 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 899 transitions. [2021-10-03 12:07:11,011 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 899 transitions. Word has length 37 [2021-10-03 12:07:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:11,012 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 899 transitions. [2021-10-03 12:07:11,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 899 transitions. [2021-10-03 12:07:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:11,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:11,014 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:11,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-03 12:07:11,014 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -331123850, now seen corresponding path program 26 times [2021-10-03 12:07:11,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:11,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808539651] [2021-10-03 12:07:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:11,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:11,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:11,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808539651] [2021-10-03 12:07:11,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808539651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:11,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:11,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:11,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14343273] [2021-10-03 12:07:11,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:11,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:11,115 INFO L87 Difference]: Start difference. First operand 371 states and 899 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:11,302 INFO L93 Difference]: Finished difference Result 436 states and 1022 transitions. [2021-10-03 12:07:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-03 12:07:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:11,304 INFO L225 Difference]: With dead ends: 436 [2021-10-03 12:07:11,304 INFO L226 Difference]: Without dead ends: 353 [2021-10-03 12:07:11,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-03 12:07:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2021-10-03 12:07:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.3920454545454546) internal successors, (842), 352 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 842 transitions. [2021-10-03 12:07:11,315 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 842 transitions. Word has length 37 [2021-10-03 12:07:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:11,315 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 842 transitions. [2021-10-03 12:07:11,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 842 transitions. [2021-10-03 12:07:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:11,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:11,317 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:11,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-03 12:07:11,317 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1287360992, now seen corresponding path program 27 times [2021-10-03 12:07:11,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:11,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689389972] [2021-10-03 12:07:11,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:11,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:11,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:11,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689389972] [2021-10-03 12:07:11,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689389972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:11,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:11,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-03 12:07:11,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587571208] [2021-10-03 12:07:11,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 12:07:11,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:11,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 12:07:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-03 12:07:11,434 INFO L87 Difference]: Start difference. First operand 353 states and 842 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:11,649 INFO L93 Difference]: Finished difference Result 418 states and 965 transitions. [2021-10-03 12:07:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:11,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:11,651 INFO L225 Difference]: With dead ends: 418 [2021-10-03 12:07:11,651 INFO L226 Difference]: Without dead ends: 233 [2021-10-03 12:07:11,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 109.8ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-03 12:07:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-03 12:07:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-03 12:07:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.2801724137931036) internal successors, (529), 232 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 529 transitions. [2021-10-03 12:07:11,658 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 529 transitions. Word has length 37 [2021-10-03 12:07:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:11,658 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 529 transitions. [2021-10-03 12:07:11,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 529 transitions. [2021-10-03 12:07:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:11,660 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:11,660 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:11,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-03 12:07:11,660 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1098767552, now seen corresponding path program 28 times [2021-10-03 12:07:11,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:11,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629784580] [2021-10-03 12:07:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:11,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:11,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:11,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629784580] [2021-10-03 12:07:11,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629784580] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:11,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:11,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-03 12:07:11,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181759993] [2021-10-03 12:07:11,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-03 12:07:11,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-03 12:07:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-10-03 12:07:11,852 INFO L87 Difference]: Start difference. First operand 233 states and 529 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:12,175 INFO L93 Difference]: Finished difference Result 244 states and 541 transitions. [2021-10-03 12:07:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-03 12:07:12,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:12,177 INFO L225 Difference]: With dead ends: 244 [2021-10-03 12:07:12,177 INFO L226 Difference]: Without dead ends: 217 [2021-10-03 12:07:12,178 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 216.2ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:07:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-03 12:07:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-10-03 12:07:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.287037037037037) internal successors, (494), 216 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 494 transitions. [2021-10-03 12:07:12,185 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 494 transitions. Word has length 37 [2021-10-03 12:07:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:12,185 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 494 transitions. [2021-10-03 12:07:12,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 494 transitions. [2021-10-03 12:07:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:12,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:12,187 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:12,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-03 12:07:12,187 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:12,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1800438858, now seen corresponding path program 29 times [2021-10-03 12:07:12,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:12,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676895433] [2021-10-03 12:07:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:12,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:12,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:12,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676895433] [2021-10-03 12:07:12,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676895433] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:12,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:12,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:12,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768646424] [2021-10-03 12:07:12,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:12,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:12,338 INFO L87 Difference]: Start difference. First operand 217 states and 494 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:12,624 INFO L93 Difference]: Finished difference Result 230 states and 509 transitions. [2021-10-03 12:07:12,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:12,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:12,626 INFO L225 Difference]: With dead ends: 230 [2021-10-03 12:07:12,626 INFO L226 Difference]: Without dead ends: 213 [2021-10-03 12:07:12,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 179.8ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:07:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-03 12:07:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-03 12:07:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.2877358490566038) internal successors, (485), 212 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 485 transitions. [2021-10-03 12:07:12,641 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 485 transitions. Word has length 37 [2021-10-03 12:07:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:12,641 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 485 transitions. [2021-10-03 12:07:12,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 485 transitions. [2021-10-03 12:07:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:12,642 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:12,642 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:12,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-03 12:07:12,642 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:12,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1615774442, now seen corresponding path program 30 times [2021-10-03 12:07:12,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:12,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100586227] [2021-10-03 12:07:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:12,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:12,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:12,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100586227] [2021-10-03 12:07:12,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100586227] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:12,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:12,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:12,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956236499] [2021-10-03 12:07:12,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:12,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:12,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:12,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:12,826 INFO L87 Difference]: Start difference. First operand 213 states and 485 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:13,093 INFO L93 Difference]: Finished difference Result 228 states and 503 transitions. [2021-10-03 12:07:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:13,094 INFO L225 Difference]: With dead ends: 228 [2021-10-03 12:07:13,094 INFO L226 Difference]: Without dead ends: 209 [2021-10-03 12:07:13,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 177.5ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:07:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-03 12:07:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-10-03 12:07:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.2884615384615383) internal successors, (476), 208 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 476 transitions. [2021-10-03 12:07:13,101 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 476 transitions. Word has length 37 [2021-10-03 12:07:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:13,101 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 476 transitions. [2021-10-03 12:07:13,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 476 transitions. [2021-10-03 12:07:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:13,102 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:13,102 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:13,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-03 12:07:13,103 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 12:07:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1382321780, now seen corresponding path program 31 times [2021-10-03 12:07:13,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:13,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814148419] [2021-10-03 12:07:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:13,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:13,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:13,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814148419] [2021-10-03 12:07:13,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814148419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:13,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:13,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:13,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487810615] [2021-10-03 12:07:13,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:13,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:13,247 INFO L87 Difference]: Start difference. First operand 209 states and 476 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:13,488 INFO L93 Difference]: Finished difference Result 262 states and 571 transitions. [2021-10-03 12:07:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:13,490 INFO L225 Difference]: With dead ends: 262 [2021-10-03 12:07:13,490 INFO L226 Difference]: Without dead ends: 133 [2021-10-03 12:07:13,490 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 161.7ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:07:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-03 12:07:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-03 12:07:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2021-10-03 12:07:13,496 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 37 [2021-10-03 12:07:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:13,496 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2021-10-03 12:07:13,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2021-10-03 12:07:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-03 12:07:13,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 12:07:13,498 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 12:07:13,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-03 12:07:13,498 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-03 12:07:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 12:07:13,499 INFO L82 PathProgramCache]: Analyzing trace with hash -420754676, now seen corresponding path program 32 times [2021-10-03 12:07:13,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 12:07:13,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672921408] [2021-10-03 12:07:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 12:07:13,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 12:07:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 12:07:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 12:07:13,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 12:07:13,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672921408] [2021-10-03 12:07:13,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672921408] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 12:07:13,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 12:07:13,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-03 12:07:13,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53641328] [2021-10-03 12:07:13,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 12:07:13,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 12:07:13,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 12:07:13,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-03 12:07:13,651 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 12:07:13,870 INFO L93 Difference]: Finished difference Result 132 states and 244 transitions. [2021-10-03 12:07:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-03 12:07:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-10-03 12:07:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 12:07:13,871 INFO L225 Difference]: With dead ends: 132 [2021-10-03 12:07:13,871 INFO L226 Difference]: Without dead ends: 0 [2021-10-03 12:07:13,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 172.0ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-10-03 12:07:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-03 12:07:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-03 12:07:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-03 12:07:13,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-10-03 12:07:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 12:07:13,872 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-03 12:07:13,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-03 12:07:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-03 12:07:13,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-03 12:07:13,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-03 12:07:13,878 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-03 12:07:13,878 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-03 12:07:13,879 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-03 12:07:13,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-03 12:07:13,884 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-03 12:07:13,884 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-03 12:07:13,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 12:07:13 BasicIcfg [2021-10-03 12:07:13,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-03 12:07:13,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-03 12:07:13,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-03 12:07:13,888 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-03 12:07:13,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:06:50" (3/4) ... [2021-10-03 12:07:13,892 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-03 12:07:13,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-03 12:07:13,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-03 12:07:13,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-03 12:07:13,907 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-10-03 12:07:13,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-03 12:07:13,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-03 12:07:13,956 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-03 12:07:13,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-03 12:07:13,958 INFO L168 Benchmark]: Toolchain (without parser) took 24344.61 ms. Allocated memory was 54.5 MB in the beginning and 186.6 MB in the end (delta: 132.1 MB). Free memory was 30.5 MB in the beginning and 150.4 MB in the end (delta: -119.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,959 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 41.9 MB. Free memory was 19.1 MB in the beginning and 19.1 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-03 12:07:13,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.06 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 32.4 MB in the end (delta: -2.3 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.20 ms. Allocated memory is still 54.5 MB. Free memory was 32.4 MB in the beginning and 30.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,960 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 28.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,961 INFO L168 Benchmark]: RCFGBuilder took 659.98 ms. Allocated memory is still 54.5 MB. Free memory was 28.9 MB in the beginning and 26.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,961 INFO L168 Benchmark]: TraceAbstraction took 23185.19 ms. Allocated memory was 54.5 MB in the beginning and 186.6 MB in the end (delta: 132.1 MB). Free memory was 26.2 MB in the beginning and 153.5 MB in the end (delta: -127.3 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,962 INFO L168 Benchmark]: Witness Printer took 69.28 ms. Allocated memory is still 186.6 MB. Free memory was 153.5 MB in the beginning and 150.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-03 12:07:13,964 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.39 ms. Allocated memory is still 41.9 MB. Free memory was 19.1 MB in the beginning and 19.1 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 322.06 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 32.4 MB in the end (delta: -2.3 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.20 ms. Allocated memory is still 54.5 MB. Free memory was 32.4 MB in the beginning and 30.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 28.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 659.98 ms. Allocated memory is still 54.5 MB. Free memory was 28.9 MB in the beginning and 26.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23185.19 ms. Allocated memory was 54.5 MB in the beginning and 186.6 MB in the end (delta: 132.1 MB). Free memory was 26.2 MB in the beginning and 153.5 MB in the end (delta: -127.3 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. * Witness Printer took 69.28 ms. Allocated memory is still 186.6 MB. Free memory was 153.5 MB in the beginning and 150.4 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: 6329.3ms, 197 PlacesBefore, 51 PlacesAfterwards, 200 TransitionsBefore, 46 TransitionsAfterwards, 5124 CoEnabledTransitionPairs, 13 FixpointIterations, 97 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 23 ConcurrentYvCompositions, 8 ChoiceCompositions, 210 TotalNumberOfCompositions, 18150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11184, positive: 10648, positive conditional: 0, positive unconditional: 10648, negative: 536, negative conditional: 0, negative unconditional: 536, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4331, positive: 4256, positive conditional: 0, positive unconditional: 4256, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4331, positive: 4221, positive conditional: 0, positive unconditional: 4221, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 110, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11184, positive: 6392, positive conditional: 0, positive unconditional: 6392, negative: 461, negative conditional: 0, negative unconditional: 461, unknown: 4331, unknown conditional: 0, unknown unconditional: 4331] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 448, Positive conditional cache size: 0, Positive unconditional cache size: 448, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - 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: 91]: 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, 259 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22986.7ms, OverallIterations: 33, TraceHistogramMax: 1, EmptinessCheckTime: 136.6ms, AutomataDifference: 9799.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6456.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2199 SDtfs, 4947 SDslu, 10437 SDs, 0 SdLazy, 8053 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4543.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 4807.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1107occurred in iteration=7, InterpolantAutomatonStates: 388, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 931.5ms AutomataMinimizationTime, 33 MinimizatonAttempts, 3367 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 98.0ms SsaConstructionTime, 1126.6ms SatisfiabilityAnalysisTime, 3963.7ms InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1203 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 9565 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-03 12:07:14,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...