/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:57:52,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:57:52,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:57:52,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:57:52,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:57:52,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:57:52,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:57:52,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:57:52,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:57:52,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:57:52,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:57:52,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:57:52,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:57:52,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:57:52,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:57:52,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:57:52,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:57:52,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:57:52,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:57:52,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:57:52,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:57:52,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:57:52,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:57:52,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:57:52,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:57:52,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:57:52,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:57:52,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:57:52,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:57:52,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:57:52,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:57:52,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:57:52,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:57:52,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:57:52,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:57:52,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:57:52,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:57:52,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:57:52,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:57:52,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:57:52,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:57:52,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:57:52,923 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:57:52,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:57:52,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:57:52,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:57:52,928 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:57:52,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:57:52,929 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:57:52,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:57:52,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:57:52,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:57:52,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:57:52,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:57:52,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:57:52,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:57:52,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:57:52,932 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:57:52,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:57:52,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:57:52,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:57:52,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:57:52,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:57:52,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:57:52,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:57:52,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:57:52,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:57:52,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:57:52,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:57:52,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:57:52,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:57:52,935 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-09 12:57:53,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:57:53,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:57:53,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:57:53,382 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:57:53,382 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:57:53,384 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-09 12:57:53,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c600160/0521794e5450467e8fcd533a8a6cc3fc/FLAG772d6e56c [2020-11-09 12:57:54,346 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:57:54,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-11-09 12:57:54,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c600160/0521794e5450467e8fcd533a8a6cc3fc/FLAG772d6e56c [2020-11-09 12:57:54,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c600160/0521794e5450467e8fcd533a8a6cc3fc [2020-11-09 12:57:54,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:57:54,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:57:54,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:57:54,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:57:54,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:57:54,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:57:54" (1/1) ... [2020-11-09 12:57:54,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57972310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:54, skipping insertion in model container [2020-11-09 12:57:54,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:57:54" (1/1) ... [2020-11-09 12:57:54,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:57:54,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:57:55,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:57:55,333 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:57:55,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:57:55,858 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:57:55,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55 WrapperNode [2020-11-09 12:57:55,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:57:55,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:57:55,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:57:55,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:57:55,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:55,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:55,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:57:55,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:57:55,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:57:55,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:57:55,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:55,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:55,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:55,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:56,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:56,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:56,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (1/1) ... [2020-11-09 12:57:56,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:57:56,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:57:56,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:57:56,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:57:56,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57: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-09 12:57:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:57:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 12:57:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-11-09 12:57:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-09 12:57:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:57:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:57:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-09 12:57:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-09 12:57:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:57:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:57:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:57:56,116 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:57:57,049 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:57:57,049 INFO L298 CfgBuilder]: Removed 36 assume(true) statements. [2020-11-09 12:57:57,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:57:57 BoogieIcfgContainer [2020-11-09 12:57:57,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:57:57,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:57:57,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:57:57,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:57:57,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:57:54" (1/3) ... [2020-11-09 12:57:57,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5936fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:57:57, skipping insertion in model container [2020-11-09 12:57:57,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:57:55" (2/3) ... [2020-11-09 12:57:57,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5936fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:57:57, skipping insertion in model container [2020-11-09 12:57:57,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:57:57" (3/3) ... [2020-11-09 12:57:57,061 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-11-09 12:57:57,077 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:57:57,078 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:57:57,082 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-11-09 12:57:57,083 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:57:57,128 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,129 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,129 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,129 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,130 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,130 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,130 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,130 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,130 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,131 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,131 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,131 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,131 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,131 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,132 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,132 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,132 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,132 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,132 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,132 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,133 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,133 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,133 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,133 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,133 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,134 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,134 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,134 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,134 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,134 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,135 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,135 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,135 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,135 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,135 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,136 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,136 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,136 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,136 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,136 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,137 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,137 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,137 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,137 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,137 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,138 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,138 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,138 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,138 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,139 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,139 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,139 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,139 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,139 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,140 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,140 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,140 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,140 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,141 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,141 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,141 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,141 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,141 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,141 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,142 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,142 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,142 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,142 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,143 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,143 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,143 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,143 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,143 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,143 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,144 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,144 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,144 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,144 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,144 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,145 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,145 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,145 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,145 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,145 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,145 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,146 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,146 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,146 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,146 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,147 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,147 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,148 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,148 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,149 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,149 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,149 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,150 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,150 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,150 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,150 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,150 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,151 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,151 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,151 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,151 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,152 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,152 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,152 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,152 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,176 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,176 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,177 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,177 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,177 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,178 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,178 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,186 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,186 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,187 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,187 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,188 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,188 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:57:57,228 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-09 12:57:57,241 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-09 12:57:57,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:57:57,266 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:57:57,266 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:57:57,266 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:57:57,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:57:57,266 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:57:57,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:57:57,267 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:57:57,284 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:57:57,286 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 188 transitions, 398 flow [2020-11-09 12:57:57,289 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 188 transitions, 398 flow [2020-11-09 12:57:57,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 188 transitions, 398 flow [2020-11-09 12:57:57,375 INFO L129 PetriNetUnfolder]: 19/236 cut-off events. [2020-11-09 12:57:57,376 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-09 12:57:57,382 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 492 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-09 12:57:57,392 INFO L116 LiptonReduction]: Number of co-enabled transitions 3172 [2020-11-09 12:57:59,714 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-09 12:57:59,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:57:59,750 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-09 12:57:59,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:57:59,772 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-09 12:57:59,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-09 12:57:59,788 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-09 12:57:59,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:57:59,817 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-09 12:57:59,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:57:59,842 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-09 12:57:59,842 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-11-09 12:58:02,624 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-09 12:58:02,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:02,658 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-09 12:58:02,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:02,678 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-09 12:58:02,679 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-09 12:58:02,711 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-09 12:58:02,743 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:02,749 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-09 12:58:02,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:02,775 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-09 12:58:02,776 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-11-09 12:58:05,144 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-09 12:58:05,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:05,180 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-09 12:58:05,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:05,206 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-09 12:58:05,207 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-09 12:58:05,220 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-09 12:58:05,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:05,252 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-09 12:58:05,277 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:05,279 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-09 12:58:05,279 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-11-09 12:58:08,097 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-09 12:58:08,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:08,150 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-09 12:58:08,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:08,174 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-09 12:58:08,174 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-11-09 12:58:08,187 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-09 12:58:08,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:08,217 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-09 12:58:08,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:08,239 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-09 12:58:08,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-09 12:58:09,118 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-09 12:58:09,152 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:09,157 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-09 12:58:09,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:09,182 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-09 12:58:09,182 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-11-09 12:58:09,204 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-09 12:58:09,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:09,232 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-09 12:58:09,249 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:09,250 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-09 12:58:09,251 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-11-09 12:58:13,192 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-09 12:58:13,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:13,231 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-09 12:58:13,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:13,270 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-09 12:58:13,270 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-11-09 12:58:13,285 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-09 12:58:13,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:13,334 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-09 12:58:13,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:13,375 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-09 12:58:13,378 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:119 [2020-11-09 12:58:15,444 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-09 12:58:15,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,479 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-09 12:58:15,497 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,498 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-09 12:58:15,499 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-11-09 12:58:15,520 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-09 12:58:15,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,549 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-09 12:58:15,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:15,570 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-09 12:58:15,570 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-11-09 12:58:18,603 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-11-09 12:58:18,827 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-11-09 12:58:19,214 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-09 12:58:19,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:19,245 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-09 12:58:19,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:19,268 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-09 12:58:19,268 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-09 12:58:19,350 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-09 12:58:19,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:19,379 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-09 12:58:19,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:19,401 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-09 12:58:19,401 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-09 12:58:19,827 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-11-09 12:58:19,947 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 12:58:20,199 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-11-09 12:58:20,338 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 12:58:20,692 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-11-09 12:58:20,710 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-09 12:58:20,838 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-09 12:58:20,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,844 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-09 12:58:20,978 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-09 12:58:20,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:20,980 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-09 12:58:20,981 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:160, output treesize:132 [2020-11-09 12:58:21,369 WARN L194 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2020-11-09 12:58:21,379 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-09 12:58:21,478 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:21,484 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-09 12:58:21,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:21,578 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-09 12:58:21,579 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:160, output treesize:132 [2020-11-09 12:58:22,687 WARN L194 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-11-09 12:58:23,011 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-09 12:58:23,752 WARN L194 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-11-09 12:58:24,072 WARN L194 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-09 12:58:24,407 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-11-09 12:58:24,632 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-11-09 12:58:26,227 WARN L194 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 161 [2020-11-09 12:58:26,701 WARN L194 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 12:58:27,691 WARN L194 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 172 [2020-11-09 12:58:28,130 WARN L194 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2020-11-09 12:58:29,914 WARN L194 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 175 DAG size of output: 173 [2020-11-09 12:58:29,948 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-09 12:58:30,538 WARN L194 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-11-09 12:58:30,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:30,550 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-09 12:58:31,211 WARN L194 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 12:58:31,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:31,213 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-09 12:58:31,214 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:362 [2020-11-09 12:58:31,865 WARN L194 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-11-09 12:58:33,797 WARN L194 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 190 DAG size of output: 184 [2020-11-09 12:58:33,822 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-09 12:58:34,722 WARN L194 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-11-09 12:58:34,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:34,736 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-09 12:58:35,645 WARN L194 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2020-11-09 12:58:35,645 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 12:58:35,647 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-09 12:58:35,647 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:359, output treesize:371 [2020-11-09 12:58:36,549 WARN L194 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2020-11-09 12:58:36,559 INFO L131 LiptonReduction]: Checked pairs total: 8034 [2020-11-09 12:58:36,559 INFO L133 LiptonReduction]: Total number of compositions: 229 [2020-11-09 12:58:36,567 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 102 flow [2020-11-09 12:58:36,610 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 425 states. [2020-11-09 12:58:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2020-11-09 12:58:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-11-09 12:58:36,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:36,619 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-11-09 12:58:36,620 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-09 12:58:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash 711, now seen corresponding path program 1 times [2020-11-09 12:58:36,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:36,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169245908] [2020-11-09 12:58:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:36,928 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-09 12:58:36,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169245908] [2020-11-09 12:58:36,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:36,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-11-09 12:58:36,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691830104] [2020-11-09 12:58:36,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-09 12:58:36,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-09 12:58:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-09 12:58:36,956 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 2 states. [2020-11-09 12:58:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:36,995 INFO L93 Difference]: Finished difference Result 423 states and 1029 transitions. [2020-11-09 12:58:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-09 12:58:36,996 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-11-09 12:58:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:37,015 INFO L225 Difference]: With dead ends: 423 [2020-11-09 12:58:37,016 INFO L226 Difference]: Without dead ends: 385 [2020-11-09 12:58:37,017 INFO L677 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-09 12:58:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-09 12:58:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2020-11-09 12:58:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-09 12:58:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 931 transitions. [2020-11-09 12:58:37,103 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 931 transitions. Word has length 1 [2020-11-09 12:58:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:37,104 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 931 transitions. [2020-11-09 12:58:37,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-09 12:58:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 931 transitions. [2020-11-09 12:58:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-09 12:58:37,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:37,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-09 12:58:37,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:58:37,105 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-09 12:58:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash 21756108, now seen corresponding path program 1 times [2020-11-09 12:58:37,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:37,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383559078] [2020-11-09 12:58:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:37,340 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-09 12:58:37,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383559078] [2020-11-09 12:58:37,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:37,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:58:37,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338201675] [2020-11-09 12:58:37,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:58:37,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:37,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:58:37,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:58:37,345 INFO L87 Difference]: Start difference. First operand 385 states and 931 transitions. Second operand 3 states. [2020-11-09 12:58:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:37,509 INFO L93 Difference]: Finished difference Result 540 states and 1306 transitions. [2020-11-09 12:58:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:58:37,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-11-09 12:58:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:37,519 INFO L225 Difference]: With dead ends: 540 [2020-11-09 12:58:37,519 INFO L226 Difference]: Without dead ends: 540 [2020-11-09 12:58:37,520 INFO L677 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-09 12:58:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-11-09 12:58:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2020-11-09 12:58:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-11-09 12:58:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1086 transitions. [2020-11-09 12:58:37,583 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1086 transitions. Word has length 4 [2020-11-09 12:58:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:37,584 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 1086 transitions. [2020-11-09 12:58:37,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:58:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1086 transitions. [2020-11-09 12:58:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-09 12:58:37,585 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:37,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-09 12:58:37,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:58:37,586 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-09 12:58:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash -567208386, now seen corresponding path program 1 times [2020-11-09 12:58:37,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:37,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176198734] [2020-11-09 12:58:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:37,724 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-09 12:58:37,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176198734] [2020-11-09 12:58:37,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:37,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:58:37,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504677513] [2020-11-09 12:58:37,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:58:37,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:58:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:58:37,727 INFO L87 Difference]: Start difference. First operand 444 states and 1086 transitions. Second operand 4 states. [2020-11-09 12:58:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:37,875 INFO L93 Difference]: Finished difference Result 599 states and 1429 transitions. [2020-11-09 12:58:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:58:37,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-11-09 12:58:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:37,880 INFO L225 Difference]: With dead ends: 599 [2020-11-09 12:58:37,881 INFO L226 Difference]: Without dead ends: 514 [2020-11-09 12:58:37,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:58:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-11-09 12:58:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 482. [2020-11-09 12:58:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-09 12:58:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1195 transitions. [2020-11-09 12:58:37,901 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1195 transitions. Word has length 6 [2020-11-09 12:58:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:37,901 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1195 transitions. [2020-11-09 12:58:37,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:58:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1195 transitions. [2020-11-09 12:58:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 12:58:37,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:37,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:58:37,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:58:37,904 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-09 12:58:37,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:37,904 INFO L82 PathProgramCache]: Analyzing trace with hash 164889039, now seen corresponding path program 1 times [2020-11-09 12:58:37,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:37,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955491222] [2020-11-09 12:58:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:38,014 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-09 12:58:38,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955491222] [2020-11-09 12:58:38,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:38,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:58:38,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320000162] [2020-11-09 12:58:38,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:58:38,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:58:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:58:38,016 INFO L87 Difference]: Start difference. First operand 482 states and 1195 transitions. Second operand 3 states. [2020-11-09 12:58:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:38,038 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-11-09 12:58:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:58:38,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 12:58:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:38,042 INFO L225 Difference]: With dead ends: 162 [2020-11-09 12:58:38,042 INFO L226 Difference]: Without dead ends: 162 [2020-11-09 12:58:38,043 INFO L677 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-09 12:58:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-09 12:58:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-09 12:58:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-09 12:58:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-11-09 12:58:38,048 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-11-09 12:58:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:38,049 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-11-09 12:58:38,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:58:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-11-09 12:58:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:38,057 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:38,057 INFO L422 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-09 12:58:38,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:58:38,058 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-09 12:58:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:38,059 INFO L82 PathProgramCache]: Analyzing trace with hash -976645078, now seen corresponding path program 1 times [2020-11-09 12:58:38,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:38,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151962461] [2020-11-09 12:58:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:38,388 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-09 12:58:38,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151962461] [2020-11-09 12:58:38,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:38,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:58:38,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550911394] [2020-11-09 12:58:38,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:58:38,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:58:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:58:38,392 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 9 states. [2020-11-09 12:58:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:38,860 INFO L93 Difference]: Finished difference Result 144 states and 313 transitions. [2020-11-09 12:58:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 12:58:38,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 12:58:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:38,862 INFO L225 Difference]: With dead ends: 144 [2020-11-09 12:58:38,862 INFO L226 Difference]: Without dead ends: 144 [2020-11-09 12:58:38,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-09 12:58:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-11-09 12:58:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-09 12:58:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 313 transitions. [2020-11-09 12:58:38,869 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 313 transitions. Word has length 22 [2020-11-09 12:58:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:38,869 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 313 transitions. [2020-11-09 12:58:38,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:58:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 313 transitions. [2020-11-09 12:58:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:38,871 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:38,871 INFO L422 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-09 12:58:38,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:58:38,871 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-09 12:58:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash -834725520, now seen corresponding path program 1 times [2020-11-09 12:58:38,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:38,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420913913] [2020-11-09 12:58:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:39,069 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-09 12:58:39,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420913913] [2020-11-09 12:58:39,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:39,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:58:39,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717664175] [2020-11-09 12:58:39,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:58:39,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:58:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:58:39,073 INFO L87 Difference]: Start difference. First operand 144 states and 313 transitions. Second operand 4 states. [2020-11-09 12:58:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:39,105 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2020-11-09 12:58:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:58:39,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-09 12:58:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:39,107 INFO L225 Difference]: With dead ends: 96 [2020-11-09 12:58:39,107 INFO L226 Difference]: Without dead ends: 96 [2020-11-09 12:58:39,107 INFO L677 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-09 12:58:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-09 12:58:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-11-09 12:58:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-09 12:58:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 161 transitions. [2020-11-09 12:58:39,111 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 161 transitions. Word has length 22 [2020-11-09 12:58:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:39,111 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 161 transitions. [2020-11-09 12:58:39,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:58:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 161 transitions. [2020-11-09 12:58:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:39,113 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:39,113 INFO L422 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-09 12:58:39,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:58:39,113 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-09 12:58:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 663150838, now seen corresponding path program 2 times [2020-11-09 12:58:39,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:39,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875188271] [2020-11-09 12:58:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:39,724 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-09 12:58:39,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875188271] [2020-11-09 12:58:39,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:39,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:58:39,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656675686] [2020-11-09 12:58:39,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:58:39,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:58:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:39,727 INFO L87 Difference]: Start difference. First operand 96 states and 161 transitions. Second operand 11 states. [2020-11-09 12:58:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:40,457 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2020-11-09 12:58:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 12:58:40,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 12:58:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:40,459 INFO L225 Difference]: With dead ends: 128 [2020-11-09 12:58:40,459 INFO L226 Difference]: Without dead ends: 128 [2020-11-09 12:58:40,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-11-09 12:58:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-09 12:58:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2020-11-09 12:58:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-09 12:58:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 210 transitions. [2020-11-09 12:58:40,465 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 210 transitions. Word has length 22 [2020-11-09 12:58:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:40,466 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 210 transitions. [2020-11-09 12:58:40,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:58:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2020-11-09 12:58:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:40,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:40,467 INFO L422 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-09 12:58:40,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:58:40,467 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-09 12:58:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 663150822, now seen corresponding path program 1 times [2020-11-09 12:58:40,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:40,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102558271] [2020-11-09 12:58:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:40,754 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-09 12:58:40,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102558271] [2020-11-09 12:58:40,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:40,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:58:40,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955676649] [2020-11-09 12:58:40,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:58:40,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:58:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:58:40,756 INFO L87 Difference]: Start difference. First operand 127 states and 210 transitions. Second operand 8 states. [2020-11-09 12:58:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:41,115 INFO L93 Difference]: Finished difference Result 164 states and 259 transitions. [2020-11-09 12:58:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:58:41,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:58:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:41,117 INFO L225 Difference]: With dead ends: 164 [2020-11-09 12:58:41,118 INFO L226 Difference]: Without dead ends: 136 [2020-11-09 12:58:41,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-09 12:58:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-11-09 12:58:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-09 12:58:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 200 transitions. [2020-11-09 12:58:41,124 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 200 transitions. Word has length 22 [2020-11-09 12:58:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:41,124 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 200 transitions. [2020-11-09 12:58:41,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:58:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 200 transitions. [2020-11-09 12:58:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:41,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:41,125 INFO L422 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-09 12:58:41,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:58:41,126 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-09 12:58:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash -917977872, now seen corresponding path program 3 times [2020-11-09 12:58:41,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:41,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199909587] [2020-11-09 12:58:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:41,617 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-09 12:58:41,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199909587] [2020-11-09 12:58:41,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:41,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:58:41,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735850656] [2020-11-09 12:58:41,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:58:41,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:58:41,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:41,619 INFO L87 Difference]: Start difference. First operand 121 states and 200 transitions. Second operand 11 states. [2020-11-09 12:58:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:42,385 INFO L93 Difference]: Finished difference Result 189 states and 307 transitions. [2020-11-09 12:58:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 12:58:42,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 12:58:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:42,387 INFO L225 Difference]: With dead ends: 189 [2020-11-09 12:58:42,387 INFO L226 Difference]: Without dead ends: 189 [2020-11-09 12:58:42,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-09 12:58:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2020-11-09 12:58:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-09 12:58:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 242 transitions. [2020-11-09 12:58:42,396 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 242 transitions. Word has length 22 [2020-11-09 12:58:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:42,396 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 242 transitions. [2020-11-09 12:58:42,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:58:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 242 transitions. [2020-11-09 12:58:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:42,397 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:42,397 INFO L422 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-09 12:58:42,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:58:42,397 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-09 12:58:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -917977888, now seen corresponding path program 2 times [2020-11-09 12:58:42,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:42,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506694427] [2020-11-09 12:58:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:42,641 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-09 12:58:42,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506694427] [2020-11-09 12:58:42,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:42,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:58:42,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843558389] [2020-11-09 12:58:42,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:58:42,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:42,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:58:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:58:42,647 INFO L87 Difference]: Start difference. First operand 147 states and 242 transitions. Second operand 8 states. [2020-11-09 12:58:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:42,963 INFO L93 Difference]: Finished difference Result 195 states and 303 transitions. [2020-11-09 12:58:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:58:42,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:58:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:42,965 INFO L225 Difference]: With dead ends: 195 [2020-11-09 12:58:42,966 INFO L226 Difference]: Without dead ends: 181 [2020-11-09 12:58:42,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-09 12:58:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2020-11-09 12:58:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-09 12:58:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-11-09 12:58:42,971 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-11-09 12:58:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:42,971 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-11-09 12:58:42,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:58:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-11-09 12:58:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:42,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:42,972 INFO L422 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-09 12:58:42,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:58:42,973 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-09 12:58:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1049502960, now seen corresponding path program 4 times [2020-11-09 12:58:42,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:42,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453382099] [2020-11-09 12:58:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:43,614 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-09 12:58:43,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453382099] [2020-11-09 12:58:43,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:43,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:58:43,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824863442] [2020-11-09 12:58:43,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:58:43,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:58:43,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:43,617 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 11 states. [2020-11-09 12:58:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:44,373 INFO L93 Difference]: Finished difference Result 190 states and 307 transitions. [2020-11-09 12:58:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-09 12:58:44,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 12:58:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:44,376 INFO L225 Difference]: With dead ends: 190 [2020-11-09 12:58:44,376 INFO L226 Difference]: Without dead ends: 174 [2020-11-09 12:58:44,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-09 12:58:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 133. [2020-11-09 12:58:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-11-09 12:58:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 219 transitions. [2020-11-09 12:58:44,382 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 219 transitions. Word has length 22 [2020-11-09 12:58:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:44,382 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 219 transitions. [2020-11-09 12:58:44,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:58:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 219 transitions. [2020-11-09 12:58:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:44,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:44,383 INFO L422 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-09 12:58:44,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:58:44,384 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-09 12:58:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1225918624, now seen corresponding path program 5 times [2020-11-09 12:58:44,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:44,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354036961] [2020-11-09 12:58:44,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:44,972 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-09 12:58:44,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354036961] [2020-11-09 12:58:44,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:44,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:58:44,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890634342] [2020-11-09 12:58:44,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:58:44,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:44,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:58:44,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:44,974 INFO L87 Difference]: Start difference. First operand 133 states and 219 transitions. Second operand 11 states. [2020-11-09 12:58:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:45,679 INFO L93 Difference]: Finished difference Result 183 states and 296 transitions. [2020-11-09 12:58:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 12:58:45,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 12:58:45,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:45,681 INFO L225 Difference]: With dead ends: 183 [2020-11-09 12:58:45,681 INFO L226 Difference]: Without dead ends: 163 [2020-11-09 12:58:45,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-11-09 12:58:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-11-09 12:58:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2020-11-09 12:58:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-11-09 12:58:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 249 transitions. [2020-11-09 12:58:45,689 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 249 transitions. Word has length 22 [2020-11-09 12:58:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:45,689 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 249 transitions. [2020-11-09 12:58:45,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:58:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 249 transitions. [2020-11-09 12:58:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:45,692 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:45,692 INFO L422 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-09 12:58:45,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:58:45,693 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-09 12:58:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1794260320, now seen corresponding path program 3 times [2020-11-09 12:58:45,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:45,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946635890] [2020-11-09 12:58:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:45,892 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-09 12:58:45,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946635890] [2020-11-09 12:58:45,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:45,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:58:45,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263783813] [2020-11-09 12:58:45,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:58:45,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:45,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:58:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:58:45,895 INFO L87 Difference]: Start difference. First operand 153 states and 249 transitions. Second operand 8 states. [2020-11-09 12:58:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:46,229 INFO L93 Difference]: Finished difference Result 203 states and 309 transitions. [2020-11-09 12:58:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:58:46,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:58:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:46,231 INFO L225 Difference]: With dead ends: 203 [2020-11-09 12:58:46,232 INFO L226 Difference]: Without dead ends: 179 [2020-11-09 12:58:46,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-09 12:58:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2020-11-09 12:58:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-09 12:58:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 183 transitions. [2020-11-09 12:58:46,236 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 183 transitions. Word has length 22 [2020-11-09 12:58:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:46,237 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 183 transitions. [2020-11-09 12:58:46,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:58:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 183 transitions. [2020-11-09 12:58:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:46,237 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:46,237 INFO L422 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-09 12:58:46,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:58:46,238 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-09 12:58:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1157540390, now seen corresponding path program 6 times [2020-11-09 12:58:46,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:46,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126155747] [2020-11-09 12:58:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:46,712 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-09 12:58:46,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126155747] [2020-11-09 12:58:46,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:46,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:58:46,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831028521] [2020-11-09 12:58:46,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:58:46,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:58:46,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:46,714 INFO L87 Difference]: Start difference. First operand 113 states and 183 transitions. Second operand 11 states. [2020-11-09 12:58:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:47,414 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2020-11-09 12:58:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 12:58:47,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 12:58:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:47,415 INFO L225 Difference]: With dead ends: 140 [2020-11-09 12:58:47,415 INFO L226 Difference]: Without dead ends: 101 [2020-11-09 12:58:47,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-11-09 12:58:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-09 12:58:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-09 12:58:47,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-09 12:58:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2020-11-09 12:58:47,419 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 22 [2020-11-09 12:58:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:47,419 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2020-11-09 12:58:47,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:58:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2020-11-09 12:58:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:47,420 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:47,420 INFO L422 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-09 12:58:47,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:58:47,421 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-09 12:58:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash 698584272, now seen corresponding path program 7 times [2020-11-09 12:58:47,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:47,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308225807] [2020-11-09 12:58:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:48,001 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-09 12:58:48,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308225807] [2020-11-09 12:58:48,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:48,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:48,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345139939] [2020-11-09 12:58:48,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:48,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:48,004 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand 12 states. [2020-11-09 12:58:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:48,808 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2020-11-09 12:58:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:58:48,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:48,810 INFO L225 Difference]: With dead ends: 129 [2020-11-09 12:58:48,810 INFO L226 Difference]: Without dead ends: 101 [2020-11-09 12:58:48,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-09 12:58:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-09 12:58:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-09 12:58:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2020-11-09 12:58:48,818 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 162 transitions. Word has length 22 [2020-11-09 12:58:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:48,818 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 162 transitions. [2020-11-09 12:58:48,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 162 transitions. [2020-11-09 12:58:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:48,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:48,819 INFO L422 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-09 12:58:48,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:58:48,819 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-09 12:58:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash -882544438, now seen corresponding path program 8 times [2020-11-09 12:58:48,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:48,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980726111] [2020-11-09 12:58:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:49,376 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-09 12:58:49,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980726111] [2020-11-09 12:58:49,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:49,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:49,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528055438] [2020-11-09 12:58:49,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:49,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:49,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:49,378 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. Second operand 12 states. [2020-11-09 12:58:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:50,168 INFO L93 Difference]: Finished difference Result 120 states and 186 transitions. [2020-11-09 12:58:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 12:58:50,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:50,173 INFO L225 Difference]: With dead ends: 120 [2020-11-09 12:58:50,173 INFO L226 Difference]: Without dead ends: 106 [2020-11-09 12:58:50,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:58:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-09 12:58:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2020-11-09 12:58:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-09 12:58:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 154 transitions. [2020-11-09 12:58:50,177 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 154 transitions. Word has length 22 [2020-11-09 12:58:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:50,177 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 154 transitions. [2020-11-09 12:58:50,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 154 transitions. [2020-11-09 12:58:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:50,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:50,178 INFO L422 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-09 12:58:50,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 12:58:50,178 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-09 12:58:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1084936394, now seen corresponding path program 9 times [2020-11-09 12:58:50,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:50,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435629395] [2020-11-09 12:58:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:50,793 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-09 12:58:50,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435629395] [2020-11-09 12:58:50,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:50,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:50,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474407426] [2020-11-09 12:58:50,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:50,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:50,795 INFO L87 Difference]: Start difference. First operand 97 states and 154 transitions. Second operand 12 states. [2020-11-09 12:58:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:51,692 INFO L93 Difference]: Finished difference Result 120 states and 185 transitions. [2020-11-09 12:58:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 12:58:51,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:51,693 INFO L225 Difference]: With dead ends: 120 [2020-11-09 12:58:51,693 INFO L226 Difference]: Without dead ends: 104 [2020-11-09 12:58:51,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:58:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-09 12:58:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2020-11-09 12:58:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-09 12:58:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2020-11-09 12:58:51,698 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 22 [2020-11-09 12:58:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:51,698 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2020-11-09 12:58:51,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2020-11-09 12:58:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:51,699 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:51,699 INFO L422 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-09 12:58:51,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 12:58:51,700 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-09 12:58:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1190485190, now seen corresponding path program 10 times [2020-11-09 12:58:51,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:51,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903285706] [2020-11-09 12:58:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:52,296 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-09 12:58:52,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903285706] [2020-11-09 12:58:52,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:52,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:52,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883036756] [2020-11-09 12:58:52,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:52,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:52,299 INFO L87 Difference]: Start difference. First operand 95 states and 150 transitions. Second operand 12 states. [2020-11-09 12:58:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:53,114 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2020-11-09 12:58:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:58:53,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:53,116 INFO L225 Difference]: With dead ends: 117 [2020-11-09 12:58:53,116 INFO L226 Difference]: Without dead ends: 91 [2020-11-09 12:58:53,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-09 12:58:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-11-09 12:58:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-09 12:58:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2020-11-09 12:58:53,120 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 22 [2020-11-09 12:58:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:53,121 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2020-11-09 12:58:53,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2020-11-09 12:58:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:53,121 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:53,121 INFO L422 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-09 12:58:53,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 12:58:53,122 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-09 12:58:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1122106956, now seen corresponding path program 11 times [2020-11-09 12:58:53,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:53,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295245497] [2020-11-09 12:58:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:53,686 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-09 12:58:53,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295245497] [2020-11-09 12:58:53,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:53,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:53,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275153406] [2020-11-09 12:58:53,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:53,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:53,688 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand 12 states. [2020-11-09 12:58:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:54,469 INFO L93 Difference]: Finished difference Result 118 states and 183 transitions. [2020-11-09 12:58:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:58:54,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:54,471 INFO L225 Difference]: With dead ends: 118 [2020-11-09 12:58:54,471 INFO L226 Difference]: Without dead ends: 82 [2020-11-09 12:58:54,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-09 12:58:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-09 12:58:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-09 12:58:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2020-11-09 12:58:54,475 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 22 [2020-11-09 12:58:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:54,475 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2020-11-09 12:58:54,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2020-11-09 12:58:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:54,476 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:54,476 INFO L422 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-09 12:58:54,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 12:58:54,476 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-09 12:58:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 131238104, now seen corresponding path program 12 times [2020-11-09 12:58:54,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:54,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344424647] [2020-11-09 12:58:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:55,073 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-09 12:58:55,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344424647] [2020-11-09 12:58:55,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:55,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:55,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338651542] [2020-11-09 12:58:55,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:55,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:55,075 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand 12 states. [2020-11-09 12:58:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:55,924 INFO L93 Difference]: Finished difference Result 112 states and 169 transitions. [2020-11-09 12:58:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:58:55,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:55,932 INFO L225 Difference]: With dead ends: 112 [2020-11-09 12:58:55,933 INFO L226 Difference]: Without dead ends: 74 [2020-11-09 12:58:55,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:58:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-09 12:58:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-09 12:58:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-09 12:58:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2020-11-09 12:58:55,936 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 22 [2020-11-09 12:58:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:55,936 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2020-11-09 12:58:55,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2020-11-09 12:58:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:55,936 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:55,937 INFO L422 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-09 12:58:55,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 12:58:55,937 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-09 12:58:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 566019722, now seen corresponding path program 13 times [2020-11-09 12:58:55,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:55,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24136464] [2020-11-09 12:58:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:56,460 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-09 12:58:56,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24136464] [2020-11-09 12:58:56,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:56,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:56,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265620915] [2020-11-09 12:58:56,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:56,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:56,463 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 12 states. [2020-11-09 12:58:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:57,420 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2020-11-09 12:58:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 12:58:57,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:57,422 INFO L225 Difference]: With dead ends: 83 [2020-11-09 12:58:57,422 INFO L226 Difference]: Without dead ends: 83 [2020-11-09 12:58:57,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:58:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-09 12:58:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2020-11-09 12:58:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-09 12:58:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-11-09 12:58:57,426 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 22 [2020-11-09 12:58:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:57,426 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-11-09 12:58:57,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-11-09 12:58:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:57,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:57,427 INFO L422 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-09 12:58:57,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-09 12:58:57,427 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-09 12:58:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash 566019706, now seen corresponding path program 4 times [2020-11-09 12:58:57,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:57,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676327135] [2020-11-09 12:58:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:57,596 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-09 12:58:57,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676327135] [2020-11-09 12:58:57,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:57,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:58:57,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278230233] [2020-11-09 12:58:57,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:58:57,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:58:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:58:57,598 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand 8 states. [2020-11-09 12:58:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:57,877 INFO L93 Difference]: Finished difference Result 92 states and 125 transitions. [2020-11-09 12:58:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:58:57,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:58:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:57,878 INFO L225 Difference]: With dead ends: 92 [2020-11-09 12:58:57,879 INFO L226 Difference]: Without dead ends: 84 [2020-11-09 12:58:57,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:58:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-09 12:58:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2020-11-09 12:58:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 12:58:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2020-11-09 12:58:57,882 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 22 [2020-11-09 12:58:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:57,882 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2020-11-09 12:58:57,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:58:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2020-11-09 12:58:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:57,883 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:57,883 INFO L422 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-09 12:58:57,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-09 12:58:57,884 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-09 12:58:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash -616705242, now seen corresponding path program 14 times [2020-11-09 12:58:57,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:57,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55366256] [2020-11-09 12:58:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:58,407 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-09 12:58:58,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55366256] [2020-11-09 12:58:58,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:58,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:58,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250131189] [2020-11-09 12:58:58,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:58,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:58,410 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand 12 states. [2020-11-09 12:58:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:58:59,146 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2020-11-09 12:58:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:58:59,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:58:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:58:59,152 INFO L225 Difference]: With dead ends: 86 [2020-11-09 12:58:59,152 INFO L226 Difference]: Without dead ends: 73 [2020-11-09 12:58:59,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:58:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-09 12:58:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-11-09 12:58:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-09 12:58:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2020-11-09 12:58:59,155 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 22 [2020-11-09 12:58:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:58:59,155 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2020-11-09 12:58:59,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:58:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2020-11-09 12:58:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:58:59,156 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:58:59,156 INFO L422 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-09 12:58:59,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-09 12:58:59,156 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-09 12:58:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:58:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1517132414, now seen corresponding path program 15 times [2020-11-09 12:58:59,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:58:59,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174600363] [2020-11-09 12:58:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:58:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:58:59,611 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-09 12:58:59,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174600363] [2020-11-09 12:58:59,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:58:59,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:58:59,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53303661] [2020-11-09 12:58:59,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:58:59,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:58:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:58:59,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:58:59,613 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand 12 states. [2020-11-09 12:59:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:00,477 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2020-11-09 12:59:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 12:59:00,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:59:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:00,479 INFO L225 Difference]: With dead ends: 88 [2020-11-09 12:59:00,479 INFO L226 Difference]: Without dead ends: 77 [2020-11-09 12:59:00,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:59:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-09 12:59:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-11-09 12:59:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-09 12:59:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2020-11-09 12:59:00,482 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 22 [2020-11-09 12:59:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:00,482 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2020-11-09 12:59:00,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:59:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2020-11-09 12:59:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:00,483 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:00,483 INFO L422 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-09 12:59:00,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-09 12:59:00,483 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-09 12:59:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1024190236, now seen corresponding path program 5 times [2020-11-09 12:59:00,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:00,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236150130] [2020-11-09 12:59:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:00,646 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-09 12:59:00,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236150130] [2020-11-09 12:59:00,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:00,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:59:00,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100462220] [2020-11-09 12:59:00,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:59:00,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:59:00,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:59:00,648 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand 8 states. [2020-11-09 12:59:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:00,929 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2020-11-09 12:59:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:59:00,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:59:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:00,931 INFO L225 Difference]: With dead ends: 76 [2020-11-09 12:59:00,931 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 12:59:00,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 12:59:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-09 12:59:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-09 12:59:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2020-11-09 12:59:00,934 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 22 [2020-11-09 12:59:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:00,935 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2020-11-09 12:59:00,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:59:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2020-11-09 12:59:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:00,935 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:00,936 INFO L422 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-09 12:59:00,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-09 12:59:00,936 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-09 12:59:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash -304507168, now seen corresponding path program 16 times [2020-11-09 12:59:00,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:00,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586750978] [2020-11-09 12:59:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:01,430 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-09 12:59:01,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586750978] [2020-11-09 12:59:01,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:01,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:59:01,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256767221] [2020-11-09 12:59:01,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:59:01,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:59:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:01,432 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand 12 states. [2020-11-09 12:59:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:02,316 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2020-11-09 12:59:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 12:59:02,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:59:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:02,326 INFO L225 Difference]: With dead ends: 77 [2020-11-09 12:59:02,326 INFO L226 Difference]: Without dead ends: 77 [2020-11-09 12:59:02,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-11-09 12:59:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-09 12:59:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-11-09 12:59:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-09 12:59:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2020-11-09 12:59:02,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 22 [2020-11-09 12:59:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:02,329 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2020-11-09 12:59:02,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:59:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2020-11-09 12:59:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:02,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:02,335 INFO L422 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-09 12:59:02,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-09 12:59:02,335 INFO L429 AbstractCegarLoop]: === Iteration 27 === [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-09 12:59:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash -304507184, now seen corresponding path program 6 times [2020-11-09 12:59:02,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:02,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244111129] [2020-11-09 12:59:02,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:02,528 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-09 12:59:02,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244111129] [2020-11-09 12:59:02,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:02,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:59:02,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080543117] [2020-11-09 12:59:02,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:59:02,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:59:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:59:02,534 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand 8 states. [2020-11-09 12:59:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:02,810 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2020-11-09 12:59:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:59:02,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:59:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:02,811 INFO L225 Difference]: With dead ends: 75 [2020-11-09 12:59:02,811 INFO L226 Difference]: Without dead ends: 59 [2020-11-09 12:59:02,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-09 12:59:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-11-09 12:59:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-09 12:59:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2020-11-09 12:59:02,814 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 22 [2020-11-09 12:59:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:02,814 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2020-11-09 12:59:02,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:59:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2020-11-09 12:59:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:02,815 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:02,815 INFO L422 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-09 12:59:02,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-09 12:59:02,815 INFO L429 AbstractCegarLoop]: === Iteration 28 === [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-09 12:59:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1003507688, now seen corresponding path program 17 times [2020-11-09 12:59:02,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:02,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680164920] [2020-11-09 12:59:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:03,314 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-09 12:59:03,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680164920] [2020-11-09 12:59:03,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:03,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:59:03,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265860177] [2020-11-09 12:59:03,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:59:03,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:03,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:59:03,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:03,319 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 12 states. [2020-11-09 12:59:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:04,094 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-11-09 12:59:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 12:59:04,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:59:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:04,095 INFO L225 Difference]: With dead ends: 66 [2020-11-09 12:59:04,095 INFO L226 Difference]: Without dead ends: 51 [2020-11-09 12:59:04,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:59:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-09 12:59:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-09 12:59:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-09 12:59:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2020-11-09 12:59:04,098 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 22 [2020-11-09 12:59:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:04,099 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2020-11-09 12:59:04,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:59:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2020-11-09 12:59:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:04,099 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:04,099 INFO L422 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-09 12:59:04,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-09 12:59:04,100 INFO L429 AbstractCegarLoop]: === Iteration 29 === [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-09 12:59:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash 35529654, now seen corresponding path program 18 times [2020-11-09 12:59:04,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:04,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468673833] [2020-11-09 12:59:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:04,599 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-09 12:59:04,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468673833] [2020-11-09 12:59:04,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:04,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:59:04,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544891476] [2020-11-09 12:59:04,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:59:04,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:59:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:04,601 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 12 states. [2020-11-09 12:59:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:05,394 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2020-11-09 12:59:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:59:05,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:59:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:05,396 INFO L225 Difference]: With dead ends: 66 [2020-11-09 12:59:05,396 INFO L226 Difference]: Without dead ends: 47 [2020-11-09 12:59:05,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:59:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-09 12:59:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-09 12:59:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-09 12:59:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-11-09 12:59:05,399 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 22 [2020-11-09 12:59:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:05,399 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-11-09 12:59:05,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:59:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-11-09 12:59:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:05,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:05,400 INFO L422 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-09 12:59:05,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-09 12:59:05,400 INFO L429 AbstractCegarLoop]: === Iteration 30 === [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-09 12:59:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1172676456, now seen corresponding path program 19 times [2020-11-09 12:59:05,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:05,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716485329] [2020-11-09 12:59:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:05,849 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-09 12:59:05,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716485329] [2020-11-09 12:59:05,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:05,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:59:05,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044137393] [2020-11-09 12:59:05,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:59:05,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:59:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:05,850 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 12 states. [2020-11-09 12:59:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:06,573 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-11-09 12:59:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:59:06,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:59:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:06,574 INFO L225 Difference]: With dead ends: 53 [2020-11-09 12:59:06,575 INFO L226 Difference]: Without dead ends: 38 [2020-11-09 12:59:06,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:59:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-11-09 12:59:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-11-09 12:59:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-09 12:59:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2020-11-09 12:59:06,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2020-11-09 12:59:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:06,578 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2020-11-09 12:59:06,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:59:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2020-11-09 12:59:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:59:06,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:59:06,579 INFO L422 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-09 12:59:06,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-09 12:59:06,580 INFO L429 AbstractCegarLoop]: === Iteration 31 === [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-09 12:59:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:59:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash 552705304, now seen corresponding path program 20 times [2020-11-09 12:59:06,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:59:06,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924237079] [2020-11-09 12:59:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:59:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:59:07,116 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-09 12:59:07,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924237079] [2020-11-09 12:59:07,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:59:07,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:59:07,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969690268] [2020-11-09 12:59:07,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:59:07,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:59:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:59:07,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:59:07,118 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 12 states. [2020-11-09 12:59:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:59:07,834 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2020-11-09 12:59:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:59:07,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 12:59:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:59:07,835 INFO L225 Difference]: With dead ends: 37 [2020-11-09 12:59:07,836 INFO L226 Difference]: Without dead ends: 0 [2020-11-09 12:59:07,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:59:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-09 12:59:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-09 12:59:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-09 12:59:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-09 12:59:07,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-11-09 12:59:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:59:07,837 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-09 12:59:07,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:59:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-09 12:59:07,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-09 12:59:07,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-09 12:59:07,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:59:07 BasicIcfg [2020-11-09 12:59:07,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:59:07,843 INFO L168 Benchmark]: Toolchain (without parser) took 73375.75 ms. Allocated memory was 155.2 MB in the beginning and 339.7 MB in the end (delta: 184.5 MB). Free memory was 126.7 MB in the beginning and 217.8 MB in the end (delta: -91.1 MB). Peak memory consumption was 94.9 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:07,843 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 155.2 MB. Free memory is still 126.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:59:07,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1384.57 ms. Allocated memory was 155.2 MB in the beginning and 190.8 MB in the end (delta: 35.7 MB). Free memory was 125.9 MB in the beginning and 136.5 MB in the end (delta: -10.6 MB). Peak memory consumption was 81.3 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:07,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.68 ms. Allocated memory is still 190.8 MB. Free memory was 136.5 MB in the beginning and 133.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:07,844 INFO L168 Benchmark]: Boogie Preprocessor took 61.02 ms. Allocated memory is still 190.8 MB. Free memory was 133.3 MB in the beginning and 130.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:07,845 INFO L168 Benchmark]: RCFGBuilder took 1028.32 ms. Allocated memory is still 190.8 MB. Free memory was 130.7 MB in the beginning and 80.9 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:07,845 INFO L168 Benchmark]: TraceAbstraction took 70788.16 ms. Allocated memory was 190.8 MB in the beginning and 339.7 MB in the end (delta: 148.9 MB). Free memory was 80.4 MB in the beginning and 217.8 MB in the end (delta: -137.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 8.0 GB. [2020-11-09 12:59:07,847 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.17 ms. Allocated memory is still 155.2 MB. Free memory is still 126.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1384.57 ms. Allocated memory was 155.2 MB in the beginning and 190.8 MB in the end (delta: 35.7 MB). Free memory was 125.9 MB in the beginning and 136.5 MB in the end (delta: -10.6 MB). Peak memory consumption was 81.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 98.68 ms. Allocated memory is still 190.8 MB. Free memory was 136.5 MB in the beginning and 133.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 61.02 ms. Allocated memory is still 190.8 MB. Free memory was 133.3 MB in the beginning and 130.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1028.32 ms. Allocated memory is still 190.8 MB. Free memory was 130.7 MB in the beginning and 80.9 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 70788.16 ms. Allocated memory was 190.8 MB in the beginning and 339.7 MB in the end (delta: 148.9 MB). Free memory was 80.4 MB in the beginning and 217.8 MB in the end (delta: -137.5 MB). Peak memory consumption was 11.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2211 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 6 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 13.8s, 174 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 39.2s, 178 PlacesBefore, 41 PlacesAfterwards, 188 TransitionsBefore, 40 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 9 FixpointIterations, 118 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 22 ConcurrentYvCompositions, 11 ChoiceCompositions, 229 TotalNumberOfCompositions, 8034 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: 70.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 39.3s, HoareTripleCheckerStatistics: 673 SDtfs, 905 SDslu, 2200 SDs, 0 SdLazy, 5702 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 27 SyntacticMatches, 41 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 15.1s 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, 31 MinimizatonAttempts, 385 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 253551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...