/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 00:31:51,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 00:31:51,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 00:31:51,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 00:31:51,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 00:31:51,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 00:31:51,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 00:31:51,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 00:31:51,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 00:31:51,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 00:31:51,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 00:31:51,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 00:31:51,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 00:31:51,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 00:31:51,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 00:31:51,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 00:31:51,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 00:31:51,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 00:31:51,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 00:31:51,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 00:31:51,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 00:31:51,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 00:31:51,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 00:31:51,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 00:31:51,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 00:31:51,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 00:31:51,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 00:31:51,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 00:31:51,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 00:31:51,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 00:31:51,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 00:31:51,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 00:31:51,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 00:31:51,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 00:31:51,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 00:31:51,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 00:31:51,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 00:31:51,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 00:31:51,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 00:31:51,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 00:31:51,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 00:31:51,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-12 00:31:51,824 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 00:31:51,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 00:31:51,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 00:31:51,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 00:31:51,829 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 00:31:51,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 00:31:51,830 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 00:31:51,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 00:31:51,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 00:31:51,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 00:31:51,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 00:31:51,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 00:31:51,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 00:31:51,832 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 00:31:51,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 00:31:51,832 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 00:31:51,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 00:31:51,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 00:31:51,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 00:31:51,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 00:31:51,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 00:31:51,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:31:51,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 00:31:51,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 00:31:51,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 00:31:51,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 00:31:51,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 00:31:51,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 00:31:51,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-12 00:31:52,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 00:31:52,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 00:31:52,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 00:31:52,239 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 00:31:52,240 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 00:31:52,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-11-12 00:31:52,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cc0c3fd/88fc6dc5bea44990958454ed6bf731aa/FLAG02b29ad0b [2020-11-12 00:31:53,257 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 00:31:53,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-11-12 00:31:53,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cc0c3fd/88fc6dc5bea44990958454ed6bf731aa/FLAG02b29ad0b [2020-11-12 00:31:53,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30cc0c3fd/88fc6dc5bea44990958454ed6bf731aa [2020-11-12 00:31:53,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 00:31:53,393 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 00:31:53,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 00:31:53,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 00:31:53,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 00:31:53,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:31:53" (1/1) ... [2020-11-12 00:31:53,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e506f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:53, skipping insertion in model container [2020-11-12 00:31:53,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:31:53" (1/1) ... [2020-11-12 00:31:53,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 00:31:53,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 00:31:54,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:31:54,694 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 00:31:54,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:31:55,196 INFO L208 MainTranslator]: Completed translation [2020-11-12 00:31:55,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55 WrapperNode [2020-11-12 00:31:55,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 00:31:55,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 00:31:55,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 00:31:55,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 00:31:55,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 00:31:55,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 00:31:55,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 00:31:55,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 00:31:55,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... [2020-11-12 00:31:55,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 00:31:55,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 00:31:55,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 00:31:55,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 00:31:55,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:31:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 00:31:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-12 00:31:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-11-12 00:31:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-12 00:31:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 00:31:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 00:31:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-12 00:31:55,444 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-12 00:31:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 00:31:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 00:31:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 00:31:55,446 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 00:31:56,343 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 00:31:56,344 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-12 00:31:56,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:31:56 BoogieIcfgContainer [2020-11-12 00:31:56,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 00:31:56,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 00:31:56,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 00:31:56,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 00:31:56,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:31:53" (1/3) ... [2020-11-12 00:31:56,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369d9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:31:56, skipping insertion in model container [2020-11-12 00:31:56,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:55" (2/3) ... [2020-11-12 00:31:56,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369d9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:31:56, skipping insertion in model container [2020-11-12 00:31:56,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:31:56" (3/3) ... [2020-11-12 00:31:56,356 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-11-12 00:31:56,373 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 00:31:56,373 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 00:31:56,377 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-12 00:31:56,379 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 00:31:56,427 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,427 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,427 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,428 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,428 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,428 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,428 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,429 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,429 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,429 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,429 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,429 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,430 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,430 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,430 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,430 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,431 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,431 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,431 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,431 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,432 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,432 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,432 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,432 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,433 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,433 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,433 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,433 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,433 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,434 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,434 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,434 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,435 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,435 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,435 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,435 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,436 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,436 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,436 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,437 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,437 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,437 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,437 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,437 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,438 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,438 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,438 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,438 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,439 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,439 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,439 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,440 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,440 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,440 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,440 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,440 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,441 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,441 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,441 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,442 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,442 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,442 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,442 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,442 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,443 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,444 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,445 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,446 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,447 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,447 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,447 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,447 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,448 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,448 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,448 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,448 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,449 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,449 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,450 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,450 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,451 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,451 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,451 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,451 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,451 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,452 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,452 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,452 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,452 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,453 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,453 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,453 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,454 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,454 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,454 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,454 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,455 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,455 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,455 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,458 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,458 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,458 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,459 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,459 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,459 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,459 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,460 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,460 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,460 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,471 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,472 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,473 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,473 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:31:56,495 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-12 00:31:56,511 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-12 00:31:56,549 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:31:56,549 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:31:56,549 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:31:56,549 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:31:56,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:31:56,550 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:31:56,550 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:31:56,550 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:31:56,577 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:31:56,580 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 188 transitions, 398 flow [2020-11-12 00:31:56,585 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 188 transitions, 398 flow [2020-11-12 00:31:56,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 188 transitions, 398 flow [2020-11-12 00:31:56,684 INFO L129 PetriNetUnfolder]: 19/236 cut-off events. [2020-11-12 00:31:56,684 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-12 00:31:56,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 236 events. 19/236 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 493 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2020-11-12 00:31:56,697 INFO L116 LiptonReduction]: Number of co-enabled transitions 3172 [2020-11-12 00:31:59,019 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:31:59,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:31:59,050 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:31:59,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:31:59,073 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:31:59,074 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:31:59,087 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:31:59,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:31:59,133 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:31:59,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:31:59,158 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:31:59,159 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:02,360 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:02,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:02,397 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:02,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:02,422 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:02,423 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:02,441 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:02,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:02,477 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:02,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:02,497 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:02,497 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:04,757 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:04,793 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:04,803 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:04,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:04,826 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:04,826 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-11-12 00:32:04,842 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:04,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:04,869 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:04,895 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:04,896 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:04,898 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-12 00:32:07,625 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:07,652 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:07,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,673 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-11-12 00:32:07,688 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:07,717 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:07,744 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,745 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-12 00:32:07,940 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:07,975 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,995 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:07,996 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:07,997 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:08,015 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:08,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:08,045 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:08,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:08,067 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:08,068 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:11,731 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:11,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:11,760 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:11,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:11,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:11,783 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-12 00:32:11,796 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:11,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:11,822 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:11,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:11,844 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:11,845 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-11-12 00:32:14,771 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:14,810 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:14,814 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:14,843 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:14,844 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:14,845 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-11-12 00:32:14,864 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:14,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:14,917 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:14,958 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:14,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:14,963 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-11-12 00:32:17,010 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:17,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:17,041 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:17,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:17,063 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:17,064 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:17,083 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:17,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:17,121 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:17,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:17,142 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:17,142 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-12 00:32:19,468 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-12 00:32:20,347 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-11-12 00:32:20,462 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-12 00:32:20,734 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2020-11-12 00:32:20,841 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-12 00:32:21,117 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:21,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:21,147 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:21,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:21,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:21,194 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-12 00:32:21,258 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:21,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:21,288 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:21,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:21,313 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:21,313 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-12 00:32:21,799 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-11-12 00:32:22,785 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-11-12 00:32:22,797 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:22,931 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-12 00:32:22,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:22,938 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:23,047 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-12 00:32:23,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:23,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:23,050 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:172, output treesize:144 [2020-11-12 00:32:23,165 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-12 00:32:23,530 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2020-11-12 00:32:23,547 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:23,686 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-12 00:32:23,687 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:23,692 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:23,825 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-12 00:32:23,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:23,827 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:23,827 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:175, output treesize:147 [2020-11-12 00:32:23,947 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-12 00:32:24,924 WARN L193 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-11-12 00:32:25,327 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-12 00:32:26,170 WARN L193 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2020-11-12 00:32:26,670 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2020-11-12 00:32:26,994 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-11-12 00:32:27,259 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2020-11-12 00:32:28,288 WARN L193 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2020-11-12 00:32:28,728 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-12 00:32:29,748 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-12 00:32:30,222 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-12 00:32:32,085 WARN L193 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 173 DAG size of output: 171 [2020-11-12 00:32:32,108 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:32,835 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-12 00:32:32,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:32,849 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:33,580 WARN L193 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-12 00:32:33,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:33,581 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:33,582 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-12 00:32:34,279 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-12 00:32:36,276 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 185 DAG size of output: 183 [2020-11-12 00:32:36,302 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:37,381 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 164 [2020-11-12 00:32:37,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:37,393 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,233 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-12 00:32:38,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-12 00:32:38,234 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-12 00:32:38,235 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:362, output treesize:374 [2020-11-12 00:32:39,214 WARN L193 SmtUtils]: Spent 977.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-12 00:32:39,227 INFO L131 LiptonReduction]: Checked pairs total: 7975 [2020-11-12 00:32:39,227 INFO L133 LiptonReduction]: Total number of compositions: 233 [2020-11-12 00:32:39,237 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-11-12 00:32:39,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 425 states, 414 states have (on average 2.582125603864734) internal successors, (1069), 424 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 414 states have (on average 2.582125603864734) internal successors, (1069), 424 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-12 00:32:39,305 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:39,305 INFO L494 BasicCegarLoop]: trace histogram [1] [2020-11-12 00:32:39,306 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 711, now seen corresponding path program 1 times [2020-11-12 00:32:39,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:39,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389337018] [2020-11-12 00:32:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:39,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389337018] [2020-11-12 00:32:39,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:39,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-12 00:32:39,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645055261] [2020-11-12 00:32:39,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-12 00:32:39,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-12 00:32:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-12 00:32:39,649 INFO L87 Difference]: Start difference. First operand has 425 states, 414 states have (on average 2.582125603864734) internal successors, (1069), 424 states have internal predecessors, (1069), 0 states have call successors, (0), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:39,686 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-11-12 00:32:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-12 00:32:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2020-11-12 00:32:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:39,706 INFO L225 Difference]: With dead ends: 423 [2020-11-12 00:32:39,707 INFO L226 Difference]: Without dead ends: 385 [2020-11-12 00:32:39,708 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-12 00:32:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-12 00:32:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-11-12 00:32:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 379 states have (on average 2.4564643799472297) internal successors, (931), 384 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-11-12 00:32:39,810 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-11-12 00:32:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:39,810 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-11-12 00:32:39,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-11-12 00:32:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-12 00:32:39,811 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:39,811 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-12 00:32:39,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 00:32:39,812 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash 21886799, now seen corresponding path program 1 times [2020-11-12 00:32:39,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:39,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527182984] [2020-11-12 00:32:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:40,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527182984] [2020-11-12 00:32:40,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:40,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 00:32:40,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766163997] [2020-11-12 00:32:40,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:32:40,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:40,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:32:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:32:40,104 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:40,240 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-11-12 00:32:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:32:40,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2020-11-12 00:32:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:40,250 INFO L225 Difference]: With dead ends: 540 [2020-11-12 00:32:40,250 INFO L226 Difference]: Without dead ends: 540 [2020-11-12 00:32:40,251 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:32:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-11-12 00:32:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-11-12 00:32:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 439 states have (on average 2.4738041002277904) internal successors, (1086), 443 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-11-12 00:32:40,298 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-11-12 00:32:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:40,299 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-11-12 00:32:40,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-11-12 00:32:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-12 00:32:40,299 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:40,299 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-12 00:32:40,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 00:32:40,300 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:40,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash -441629550, now seen corresponding path program 1 times [2020-11-12 00:32:40,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:40,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800536899] [2020-11-12 00:32:40,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:40,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800536899] [2020-11-12 00:32:40,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:40,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-12 00:32:40,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498147925] [2020-11-12 00:32:40,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:32:40,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:40,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:32:40,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:32:40,474 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:40,695 INFO L93 Difference]: Finished difference Result 600 states and 1430 transitions. [2020-11-12 00:32:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:32:40,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2020-11-12 00:32:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:40,700 INFO L225 Difference]: With dead ends: 600 [2020-11-12 00:32:40,700 INFO L226 Difference]: Without dead ends: 514 [2020-11-12 00:32:40,700 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:32:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-11-12 00:32:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-11-12 00:32:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 478 states have (on average 2.5) internal successors, (1195), 481 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-11-12 00:32:40,726 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-11-12 00:32:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:40,726 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-11-12 00:32:40,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-11-12 00:32:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-12 00:32:40,729 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:40,729 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:32:40,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 00:32:40,730 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1425418294, now seen corresponding path program 1 times [2020-11-12 00:32:40,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:40,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894601290] [2020-11-12 00:32:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:40,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894601290] [2020-11-12 00:32:40,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:40,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:32:40,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864055426] [2020-11-12 00:32:40,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:32:40,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:32:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:32:40,819 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:40,838 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-11-12 00:32:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:32:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2020-11-12 00:32:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:40,841 INFO L225 Difference]: With dead ends: 162 [2020-11-12 00:32:40,841 INFO L226 Difference]: Without dead ends: 162 [2020-11-12 00:32:40,841 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:32:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-12 00:32:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-12 00:32:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 2.16875) internal successors, (347), 161 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-11-12 00:32:40,848 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-11-12 00:32:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:40,848 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-11-12 00:32:40,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-11-12 00:32:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:40,857 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:40,858 INFO L494 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] [2020-11-12 00:32:40,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 00:32:40,858 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:40,858 INFO L82 PathProgramCache]: Analyzing trace with hash -937205866, now seen corresponding path program 1 times [2020-11-12 00:32:40,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:40,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558279126] [2020-11-12 00:32:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:41,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558279126] [2020-11-12 00:32:41,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:41,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 00:32:41,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922205603] [2020-11-12 00:32:41,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:32:41,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:41,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:32:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:32:41,401 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:41,810 INFO L93 Difference]: Finished difference Result 255 states and 505 transitions. [2020-11-12 00:32:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:32:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:41,812 INFO L225 Difference]: With dead ends: 255 [2020-11-12 00:32:41,813 INFO L226 Difference]: Without dead ends: 255 [2020-11-12 00:32:41,813 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-11-12 00:32:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2020-11-12 00:32:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.0710659898477157) internal successors, (408), 198 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 408 transitions. [2020-11-12 00:32:41,820 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 408 transitions. Word has length 22 [2020-11-12 00:32:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:41,821 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 408 transitions. [2020-11-12 00:32:41,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 408 transitions. [2020-11-12 00:32:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:41,822 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:41,823 INFO L494 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] [2020-11-12 00:32:41,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 00:32:41,823 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash -937205849, now seen corresponding path program 1 times [2020-11-12 00:32:41,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:41,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370801479] [2020-11-12 00:32:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:41,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370801479] [2020-11-12 00:32:41,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:41,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:32:41,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928576440] [2020-11-12 00:32:41,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-12 00:32:41,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-12 00:32:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-12 00:32:41,995 INFO L87 Difference]: Start difference. First operand 199 states and 408 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:42,027 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2020-11-12 00:32:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-12 00:32:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:42,030 INFO L225 Difference]: With dead ends: 140 [2020-11-12 00:32:42,030 INFO L226 Difference]: Without dead ends: 140 [2020-11-12 00:32:42,030 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-12 00:32:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-12 00:32:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2020-11-12 00:32:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.7007299270072993) internal successors, (233), 138 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 233 transitions. [2020-11-12 00:32:42,035 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 233 transitions. Word has length 22 [2020-11-12 00:32:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:42,035 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 233 transitions. [2020-11-12 00:32:42,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 233 transitions. [2020-11-12 00:32:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:42,036 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:42,037 INFO L494 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] [2020-11-12 00:32:42,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 00:32:42,037 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1923342681, now seen corresponding path program 1 times [2020-11-12 00:32:42,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:42,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060526967] [2020-11-12 00:32:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:42,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060526967] [2020-11-12 00:32:42,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:42,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:32:42,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077059624] [2020-11-12 00:32:42,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:32:42,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:32:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:32:42,250 INFO L87 Difference]: Start difference. First operand 139 states and 233 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:42,596 INFO L93 Difference]: Finished difference Result 142 states and 232 transitions. [2020-11-12 00:32:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:32:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:42,599 INFO L225 Difference]: With dead ends: 142 [2020-11-12 00:32:42,599 INFO L226 Difference]: Without dead ends: 142 [2020-11-12 00:32:42,600 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-12 00:32:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2020-11-12 00:32:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.640625) internal successors, (210), 129 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 210 transitions. [2020-11-12 00:32:42,610 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 210 transitions. Word has length 22 [2020-11-12 00:32:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:42,610 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 210 transitions. [2020-11-12 00:32:42,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 210 transitions. [2020-11-12 00:32:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:42,614 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:42,614 INFO L494 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] [2020-11-12 00:32:42,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 00:32:42,615 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:42,617 INFO L82 PathProgramCache]: Analyzing trace with hash -143303689, now seen corresponding path program 2 times [2020-11-12 00:32:42,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:42,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207533099] [2020-11-12 00:32:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:43,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207533099] [2020-11-12 00:32:43,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:43,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:43,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459490400] [2020-11-12 00:32:43,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:43,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:43,518 INFO L87 Difference]: Start difference. First operand 130 states and 210 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:44,510 INFO L93 Difference]: Finished difference Result 142 states and 221 transitions. [2020-11-12 00:32:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 00:32:44,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:44,513 INFO L225 Difference]: With dead ends: 142 [2020-11-12 00:32:44,513 INFO L226 Difference]: Without dead ends: 130 [2020-11-12 00:32:44,514 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-11-12 00:32:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-12 00:32:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-11-12 00:32:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.625) internal successors, (208), 129 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2020-11-12 00:32:44,520 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 22 [2020-11-12 00:32:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:44,520 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2020-11-12 00:32:44,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2020-11-12 00:32:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:44,521 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:44,521 INFO L494 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] [2020-11-12 00:32:44,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 00:32:44,521 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash -695314200, now seen corresponding path program 2 times [2020-11-12 00:32:44,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:44,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529911165] [2020-11-12 00:32:44,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:44,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529911165] [2020-11-12 00:32:44,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:44,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 00:32:44,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537379326] [2020-11-12 00:32:44,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:32:44,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:44,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:32:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:32:44,862 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:45,207 INFO L93 Difference]: Finished difference Result 174 states and 267 transitions. [2020-11-12 00:32:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-12 00:32:45,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:45,210 INFO L225 Difference]: With dead ends: 174 [2020-11-12 00:32:45,211 INFO L226 Difference]: Without dead ends: 174 [2020-11-12 00:32:45,211 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-12 00:32:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2020-11-12 00:32:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.623076923076923) internal successors, (211), 131 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 211 transitions. [2020-11-12 00:32:45,217 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 211 transitions. Word has length 22 [2020-11-12 00:32:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:45,217 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 211 transitions. [2020-11-12 00:32:45,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 211 transitions. [2020-11-12 00:32:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:45,218 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:45,218 INFO L494 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] [2020-11-12 00:32:45,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 00:32:45,219 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash -695314183, now seen corresponding path program 3 times [2020-11-12 00:32:45,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:45,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91463955] [2020-11-12 00:32:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:46,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91463955] [2020-11-12 00:32:46,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:46,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:46,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602153720] [2020-11-12 00:32:46,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:46,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:46,057 INFO L87 Difference]: Start difference. First operand 132 states and 211 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:46,965 INFO L93 Difference]: Finished difference Result 154 states and 239 transitions. [2020-11-12 00:32:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:32:46,966 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:46,967 INFO L225 Difference]: With dead ends: 154 [2020-11-12 00:32:46,967 INFO L226 Difference]: Without dead ends: 128 [2020-11-12 00:32:46,968 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-12 00:32:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-11-12 00:32:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.6031746031746033) internal successors, (202), 127 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 202 transitions. [2020-11-12 00:32:46,973 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 202 transitions. Word has length 22 [2020-11-12 00:32:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:46,973 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 202 transitions. [2020-11-12 00:32:46,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 202 transitions. [2020-11-12 00:32:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:46,974 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:46,974 INFO L494 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] [2020-11-12 00:32:46,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 00:32:46,975 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash -7951501, now seen corresponding path program 2 times [2020-11-12 00:32:46,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:46,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882968678] [2020-11-12 00:32:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:47,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882968678] [2020-11-12 00:32:47,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:47,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 00:32:47,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714003858] [2020-11-12 00:32:47,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:32:47,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:32:47,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:32:47,151 INFO L87 Difference]: Start difference. First operand 128 states and 202 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:47,706 INFO L93 Difference]: Finished difference Result 176 states and 286 transitions. [2020-11-12 00:32:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 00:32:47,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:47,708 INFO L225 Difference]: With dead ends: 176 [2020-11-12 00:32:47,708 INFO L226 Difference]: Without dead ends: 176 [2020-11-12 00:32:47,709 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:32:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-12 00:32:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2020-11-12 00:32:47,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 135 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 221 transitions. [2020-11-12 00:32:47,713 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 221 transitions. Word has length 22 [2020-11-12 00:32:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:47,714 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 221 transitions. [2020-11-12 00:32:47,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 221 transitions. [2020-11-12 00:32:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:47,714 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:47,715 INFO L494 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] [2020-11-12 00:32:47,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 00:32:47,715 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1405559209, now seen corresponding path program 4 times [2020-11-12 00:32:47,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:47,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741836297] [2020-11-12 00:32:47,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:48,404 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2020-11-12 00:32:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:48,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741836297] [2020-11-12 00:32:48,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:48,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:48,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631234] [2020-11-12 00:32:48,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:48,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:48,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:48,581 INFO L87 Difference]: Start difference. First operand 136 states and 221 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:49,411 INFO L93 Difference]: Finished difference Result 144 states and 228 transitions. [2020-11-12 00:32:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 00:32:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:49,414 INFO L225 Difference]: With dead ends: 144 [2020-11-12 00:32:49,414 INFO L226 Difference]: Without dead ends: 136 [2020-11-12 00:32:49,415 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-12 00:32:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-11-12 00:32:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 135 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 220 transitions. [2020-11-12 00:32:49,419 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 220 transitions. Word has length 22 [2020-11-12 00:32:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:49,419 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 220 transitions. [2020-11-12 00:32:49,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 220 transitions. [2020-11-12 00:32:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:49,420 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:49,420 INFO L494 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] [2020-11-12 00:32:49,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 00:32:49,421 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1415489817, now seen corresponding path program 5 times [2020-11-12 00:32:49,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:49,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182723566] [2020-11-12 00:32:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:50,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182723566] [2020-11-12 00:32:50,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:50,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:50,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428652428] [2020-11-12 00:32:50,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:50,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:50,139 INFO L87 Difference]: Start difference. First operand 136 states and 220 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:50,759 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-11-12 00:32:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:50,908 INFO L93 Difference]: Finished difference Result 143 states and 226 transitions. [2020-11-12 00:32:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:32:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:50,910 INFO L225 Difference]: With dead ends: 143 [2020-11-12 00:32:50,910 INFO L226 Difference]: Without dead ends: 122 [2020-11-12 00:32:50,911 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-12 00:32:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-12 00:32:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.6416666666666666) internal successors, (197), 121 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 197 transitions. [2020-11-12 00:32:50,916 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 197 transitions. Word has length 22 [2020-11-12 00:32:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:50,917 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 197 transitions. [2020-11-12 00:32:50,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 197 transitions. [2020-11-12 00:32:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:50,917 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:50,918 INFO L494 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] [2020-11-12 00:32:50,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-12 00:32:50,918 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:50,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash 684937219, now seen corresponding path program 6 times [2020-11-12 00:32:50,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:50,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710050969] [2020-11-12 00:32:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:51,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710050969] [2020-11-12 00:32:51,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:51,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:51,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765593897] [2020-11-12 00:32:51,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:51,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:51,712 INFO L87 Difference]: Start difference. First operand 122 states and 197 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:52,485 INFO L93 Difference]: Finished difference Result 135 states and 209 transitions. [2020-11-12 00:32:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 00:32:52,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:52,487 INFO L225 Difference]: With dead ends: 135 [2020-11-12 00:32:52,487 INFO L226 Difference]: Without dead ends: 120 [2020-11-12 00:32:52,488 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-12 00:32:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-11-12 00:32:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.6355932203389831) internal successors, (193), 119 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 193 transitions. [2020-11-12 00:32:52,492 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 193 transitions. Word has length 22 [2020-11-12 00:32:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:52,493 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 193 transitions. [2020-11-12 00:32:52,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 193 transitions. [2020-11-12 00:32:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:52,493 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:52,494 INFO L494 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] [2020-11-12 00:32:52,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-12 00:32:52,494 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 585626039, now seen corresponding path program 7 times [2020-11-12 00:32:52,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:52,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352460638] [2020-11-12 00:32:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:53,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352460638] [2020-11-12 00:32:53,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:53,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:53,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638876372] [2020-11-12 00:32:53,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:53,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:53,303 INFO L87 Difference]: Start difference. First operand 120 states and 193 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:54,121 INFO L93 Difference]: Finished difference Result 135 states and 207 transitions. [2020-11-12 00:32:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:32:54,122 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:54,124 INFO L225 Difference]: With dead ends: 135 [2020-11-12 00:32:54,124 INFO L226 Difference]: Without dead ends: 116 [2020-11-12 00:32:54,124 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-12 00:32:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-11-12 00:32:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.6228070175438596) internal successors, (185), 115 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2020-11-12 00:32:54,129 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 185 transitions. Word has length 22 [2020-11-12 00:32:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:54,129 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 185 transitions. [2020-11-12 00:32:54,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 185 transitions. [2020-11-12 00:32:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:54,130 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:54,130 INFO L494 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] [2020-11-12 00:32:54,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-12 00:32:54,131 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1616627447, now seen corresponding path program 8 times [2020-11-12 00:32:54,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:54,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860420330] [2020-11-12 00:32:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:54,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860420330] [2020-11-12 00:32:54,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:54,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:54,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049814049] [2020-11-12 00:32:54,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:54,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:54,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:54,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:54,903 INFO L87 Difference]: Start difference. First operand 116 states and 185 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:55,657 INFO L93 Difference]: Finished difference Result 116 states and 184 transitions. [2020-11-12 00:32:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:32:55,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:55,659 INFO L225 Difference]: With dead ends: 116 [2020-11-12 00:32:55,660 INFO L226 Difference]: Without dead ends: 101 [2020-11-12 00:32:55,660 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-12 00:32:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-12 00:32:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.707070707070707) internal successors, (169), 100 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 169 transitions. [2020-11-12 00:32:55,664 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 169 transitions. Word has length 22 [2020-11-12 00:32:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:55,664 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 169 transitions. [2020-11-12 00:32:55,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 169 transitions. [2020-11-12 00:32:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:55,665 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:55,665 INFO L494 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] [2020-11-12 00:32:55,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-12 00:32:55,665 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 553824598, now seen corresponding path program 3 times [2020-11-12 00:32:55,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:55,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437256246] [2020-11-12 00:32:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:55,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437256246] [2020-11-12 00:32:55,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:55,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 00:32:55,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855409584] [2020-11-12 00:32:55,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:32:55,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:55,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:32:55,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:32:55,948 INFO L87 Difference]: Start difference. First operand 101 states and 169 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:56,222 INFO L93 Difference]: Finished difference Result 131 states and 216 transitions. [2020-11-12 00:32:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:32:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:56,224 INFO L225 Difference]: With dead ends: 131 [2020-11-12 00:32:56,224 INFO L226 Difference]: Without dead ends: 131 [2020-11-12 00:32:56,225 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-12 00:32:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-11-12 00:32:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 1.6744186046511629) internal successors, (216), 130 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 216 transitions. [2020-11-12 00:32:56,229 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 216 transitions. Word has length 22 [2020-11-12 00:32:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:56,229 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 216 transitions. [2020-11-12 00:32:56,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 216 transitions. [2020-11-12 00:32:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:56,230 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:56,230 INFO L494 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] [2020-11-12 00:32:56,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-12 00:32:56,230 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash 553824615, now seen corresponding path program 9 times [2020-11-12 00:32:56,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:56,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811908930] [2020-11-12 00:32:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:57,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811908930] [2020-11-12 00:32:57,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:57,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:57,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087101111] [2020-11-12 00:32:57,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:57,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:57,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:57,074 INFO L87 Difference]: Start difference. First operand 131 states and 216 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:57,897 INFO L93 Difference]: Finished difference Result 161 states and 260 transitions. [2020-11-12 00:32:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:32:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:57,899 INFO L225 Difference]: With dead ends: 161 [2020-11-12 00:32:57,899 INFO L226 Difference]: Without dead ends: 130 [2020-11-12 00:32:57,899 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-12 00:32:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-11-12 00:32:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.671875) internal successors, (214), 129 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 214 transitions. [2020-11-12 00:32:57,904 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 214 transitions. Word has length 22 [2020-11-12 00:32:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:57,904 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 214 transitions. [2020-11-12 00:32:57,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 214 transitions. [2020-11-12 00:32:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:57,905 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:57,905 INFO L494 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] [2020-11-12 00:32:57,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-12 00:32:57,905 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:57,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1202368021, now seen corresponding path program 10 times [2020-11-12 00:32:57,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:57,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701301871] [2020-11-12 00:32:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:32:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:32:58,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701301871] [2020-11-12 00:32:58,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:32:58,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:32:58,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396632559] [2020-11-12 00:32:58,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:32:58,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:32:58,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:32:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:32:58,742 INFO L87 Difference]: Start difference. First operand 130 states and 214 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:32:59,628 INFO L93 Difference]: Finished difference Result 169 states and 273 transitions. [2020-11-12 00:32:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:32:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:32:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:32:59,630 INFO L225 Difference]: With dead ends: 169 [2020-11-12 00:32:59,630 INFO L226 Difference]: Without dead ends: 127 [2020-11-12 00:32:59,630 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:32:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-12 00:32:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-12 00:32:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 1.656) internal successors, (207), 126 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 207 transitions. [2020-11-12 00:32:59,636 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 207 transitions. Word has length 22 [2020-11-12 00:32:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:32:59,636 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 207 transitions. [2020-11-12 00:32:59,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:32:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 207 transitions. [2020-11-12 00:32:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:32:59,637 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:32:59,637 INFO L494 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] [2020-11-12 00:32:59,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-12 00:32:59,637 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:32:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:32:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash 20108151, now seen corresponding path program 11 times [2020-11-12 00:32:59,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:32:59,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717766003] [2020-11-12 00:32:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:32:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:00,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717766003] [2020-11-12 00:33:00,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:00,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:33:00,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426733118] [2020-11-12 00:33:00,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:33:00,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:33:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:33:00,402 INFO L87 Difference]: Start difference. First operand 127 states and 207 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:01,299 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2020-11-12 00:33:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:33:01,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:01,302 INFO L225 Difference]: With dead ends: 164 [2020-11-12 00:33:01,302 INFO L226 Difference]: Without dead ends: 125 [2020-11-12 00:33:01,302 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:33:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-12 00:33:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-11-12 00:33:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.6504065040650406) internal successors, (203), 124 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 203 transitions. [2020-11-12 00:33:01,307 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 203 transitions. Word has length 22 [2020-11-12 00:33:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:01,307 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 203 transitions. [2020-11-12 00:33:01,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 203 transitions. [2020-11-12 00:33:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:33:01,308 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:01,308 INFO L494 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] [2020-11-12 00:33:01,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-12 00:33:01,309 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:33:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1507364363, now seen corresponding path program 12 times [2020-11-12 00:33:01,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:01,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858552747] [2020-11-12 00:33:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:02,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858552747] [2020-11-12 00:33:02,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:02,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:33:02,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089069154] [2020-11-12 00:33:02,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:33:02,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:33:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:33:02,011 INFO L87 Difference]: Start difference. First operand 125 states and 203 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:02,886 INFO L93 Difference]: Finished difference Result 125 states and 202 transitions. [2020-11-12 00:33:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 00:33:02,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:02,888 INFO L225 Difference]: With dead ends: 125 [2020-11-12 00:33:02,888 INFO L226 Difference]: Without dead ends: 88 [2020-11-12 00:33:02,889 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:33:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-12 00:33:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-11-12 00:33:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 87 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 141 transitions. [2020-11-12 00:33:02,892 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 141 transitions. Word has length 22 [2020-11-12 00:33:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:02,893 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 141 transitions. [2020-11-12 00:33:02,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 141 transitions. [2020-11-12 00:33:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:33:02,894 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:02,894 INFO L494 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] [2020-11-12 00:33:02,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-12 00:33:02,894 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:33:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:02,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1470970732, now seen corresponding path program 4 times [2020-11-12 00:33:02,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:02,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613731626] [2020-11-12 00:33:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:03,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613731626] [2020-11-12 00:33:03,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:03,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 00:33:03,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691062141] [2020-11-12 00:33:03,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:33:03,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:03,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:33:03,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:33:03,215 INFO L87 Difference]: Start difference. First operand 88 states and 141 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:03,421 INFO L93 Difference]: Finished difference Result 123 states and 191 transitions. [2020-11-12 00:33:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:33:03,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:03,423 INFO L225 Difference]: With dead ends: 123 [2020-11-12 00:33:03,423 INFO L226 Difference]: Without dead ends: 123 [2020-11-12 00:33:03,423 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:33:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-12 00:33:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2020-11-12 00:33:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 111 states have (on average 1.6126126126126126) internal successors, (179), 112 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 179 transitions. [2020-11-12 00:33:03,427 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 179 transitions. Word has length 22 [2020-11-12 00:33:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:03,427 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 179 transitions. [2020-11-12 00:33:03,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 179 transitions. [2020-11-12 00:33:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:33:03,428 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:03,428 INFO L494 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] [2020-11-12 00:33:03,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-12 00:33:03,429 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:33:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1470970749, now seen corresponding path program 13 times [2020-11-12 00:33:03,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:03,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648738936] [2020-11-12 00:33:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:04,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648738936] [2020-11-12 00:33:04,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:04,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:33:04,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579909267] [2020-11-12 00:33:04,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:33:04,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:33:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:33:04,194 INFO L87 Difference]: Start difference. First operand 113 states and 179 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:05,049 INFO L93 Difference]: Finished difference Result 133 states and 206 transitions. [2020-11-12 00:33:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 00:33:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:05,051 INFO L225 Difference]: With dead ends: 133 [2020-11-12 00:33:05,051 INFO L226 Difference]: Without dead ends: 108 [2020-11-12 00:33:05,051 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:33:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-12 00:33:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-11-12 00:33:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 107 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2020-11-12 00:33:05,054 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 22 [2020-11-12 00:33:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:05,054 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 167 transitions. [2020-11-12 00:33:05,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 167 transitions. [2020-11-12 00:33:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:33:05,055 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:05,055 INFO L494 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] [2020-11-12 00:33:05,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-12 00:33:05,056 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:33:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2003521211, now seen corresponding path program 14 times [2020-11-12 00:33:05,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:05,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348169191] [2020-11-12 00:33:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:05,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348169191] [2020-11-12 00:33:05,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:05,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:33:05,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960069873] [2020-11-12 00:33:05,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:33:05,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:33:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:33:05,783 INFO L87 Difference]: Start difference. First operand 108 states and 167 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:06,689 INFO L93 Difference]: Finished difference Result 127 states and 189 transitions. [2020-11-12 00:33:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 00:33:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:06,691 INFO L225 Difference]: With dead ends: 127 [2020-11-12 00:33:06,691 INFO L226 Difference]: Without dead ends: 107 [2020-11-12 00:33:06,691 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-11-12 00:33:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-12 00:33:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2020-11-12 00:33:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 97 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2020-11-12 00:33:06,695 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 22 [2020-11-12 00:33:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:06,695 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2020-11-12 00:33:06,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2020-11-12 00:33:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:33:06,696 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:06,696 INFO L494 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] [2020-11-12 00:33:06,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-12 00:33:06,696 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:33:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 188419575, now seen corresponding path program 15 times [2020-11-12 00:33:06,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:06,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555921552] [2020-11-12 00:33:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:07,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555921552] [2020-11-12 00:33:07,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:07,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 00:33:07,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902191985] [2020-11-12 00:33:07,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 00:33:07,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:07,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 00:33:07,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-12 00:33:07,336 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:08,020 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2020-11-12 00:33:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 00:33:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:08,022 INFO L225 Difference]: With dead ends: 106 [2020-11-12 00:33:08,022 INFO L226 Difference]: Without dead ends: 80 [2020-11-12 00:33:08,022 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-11-12 00:33:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-12 00:33:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2020-11-12 00:33:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.542857142857143) internal successors, (108), 70 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2020-11-12 00:33:08,027 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 22 [2020-11-12 00:33:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:08,027 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2020-11-12 00:33:08,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2020-11-12 00:33:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:33:08,033 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:33:08,034 INFO L494 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] [2020-11-12 00:33:08,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-12 00:33:08,034 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:33:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:33:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1335930292, now seen corresponding path program 5 times [2020-11-12 00:33:08,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:33:08,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893052534] [2020-11-12 00:33:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:33:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:33:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:33:08,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893052534] [2020-11-12 00:33:08,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:33:08,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 00:33:08,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070778779] [2020-11-12 00:33:08,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 00:33:08,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:33:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 00:33:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:33:08,312 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:33:08,487 INFO L93 Difference]: Finished difference Result 70 states and 107 transitions. [2020-11-12 00:33:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:33:08,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-12 00:33:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:33:08,489 INFO L225 Difference]: With dead ends: 70 [2020-11-12 00:33:08,489 INFO L226 Difference]: Without dead ends: 0 [2020-11-12 00:33:08,489 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:33:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-12 00:33:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-12 00:33:08,490 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) [2020-11-12 00:33:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-12 00:33:08,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-11-12 00:33:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:33:08,490 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-12 00:33:08,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:33:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-12 00:33:08,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-12 00:33:08,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-12 00:33:08,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:33:08 BasicIcfg [2020-11-12 00:33:08,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 00:33:08,495 INFO L168 Benchmark]: Toolchain (without parser) took 75110.46 ms. Allocated memory was 302.0 MB in the beginning and 474.0 MB in the end (delta: 172.0 MB). Free memory was 275.1 MB in the beginning and 314.6 MB in the end (delta: -39.5 MB). Peak memory consumption was 134.1 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:08,496 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 00:33:08,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1800.53 ms. Allocated memory is still 302.0 MB. Free memory was 274.4 MB in the beginning and 171.6 MB in the end (delta: 102.8 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:08,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.34 ms. Allocated memory is still 302.0 MB. Free memory was 171.6 MB in the beginning and 168.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:08,497 INFO L168 Benchmark]: Boogie Preprocessor took 84.45 ms. Allocated memory is still 302.0 MB. Free memory was 168.5 MB in the beginning and 165.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:08,497 INFO L168 Benchmark]: RCFGBuilder took 978.03 ms. Allocated memory was 302.0 MB in the beginning and 392.2 MB in the end (delta: 90.2 MB). Free memory was 165.3 MB in the beginning and 327.4 MB in the end (delta: -162.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:08,498 INFO L168 Benchmark]: TraceAbstraction took 72145.91 ms. Allocated memory was 392.2 MB in the beginning and 474.0 MB in the end (delta: 81.8 MB). Free memory was 326.3 MB in the beginning and 314.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 92.5 MB. Max. memory is 16.0 GB. [2020-11-12 00:33:08,500 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.15 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1800.53 ms. Allocated memory is still 302.0 MB. Free memory was 274.4 MB in the beginning and 171.6 MB in the end (delta: 102.8 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 84.34 ms. Allocated memory is still 302.0 MB. Free memory was 171.6 MB in the beginning and 168.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 84.45 ms. Allocated memory is still 302.0 MB. Free memory was 168.5 MB in the beginning and 165.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 978.03 ms. Allocated memory was 302.0 MB in the beginning and 392.2 MB in the end (delta: 90.2 MB). Free memory was 165.3 MB in the beginning and 327.4 MB in the end (delta: -162.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 72145.91 ms. Allocated memory was 392.2 MB in the beginning and 474.0 MB in the end (delta: 81.8 MB). Free memory was 326.3 MB in the beginning and 314.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 92.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2206 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 7 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 15.9s, 168 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 42.6s, 178 PlacesBefore, 41 PlacesAfterwards, 188 TransitionsBefore, 40 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 8 FixpointIterations, 121 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 23 ConcurrentYvCompositions, 11 ChoiceCompositions, 233 TotalNumberOfCompositions, 7975 MoverChecksTotal - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 158 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 71.9s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 42.7s, HoareTripleCheckerStatistics: 632 SDtfs, 872 SDslu, 2025 SDs, 0 SdLazy, 4360 SolverSat, 397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 22 SyntacticMatches, 33 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 307 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 214242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...