/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-11 16:00:35,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-11 16:00:35,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-11 16:00:35,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-11 16:00:35,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-11 16:00:35,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-11 16:00:35,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-11 16:00:35,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-11 16:00:35,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-11 16:00:35,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-11 16:00:35,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-11 16:00:35,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-11 16:00:35,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-11 16:00:35,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-11 16:00:35,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-11 16:00:35,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-11 16:00:35,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-11 16:00:35,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-11 16:00:35,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-11 16:00:35,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-11 16:00:35,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-11 16:00:35,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-11 16:00:35,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-11 16:00:35,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-11 16:00:35,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-11 16:00:35,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-11 16:00:35,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-11 16:00:35,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-11 16:00:35,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-11 16:00:35,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-11 16:00:35,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-11 16:00:35,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-11 16:00:35,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-11 16:00:35,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-11 16:00:35,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-11 16:00:35,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-11 16:00:35,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-11 16:00:35,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-11 16:00:35,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-11 16:00:35,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-11 16:00:35,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-11 16:00:35,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-11 16:00:35,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-11 16:00:35,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-11 16:00:35,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-11 16:00:35,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-11 16:00:35,791 INFO L138 SettingsManager]: * Use SBE=true [2020-09-11 16:00:35,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-11 16:00:35,792 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-11 16:00:35,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-11 16:00:35,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-11 16:00:35,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-11 16:00:35,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-11 16:00:35,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-11 16:00:35,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-11 16:00:35,795 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-11 16:00:35,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-11 16:00:35,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-11 16:00:35,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-11 16:00:35,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-11 16:00:35,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-11 16:00:35,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-11 16:00:35,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-11 16:00:35,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 16:00:35,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-11 16:00:35,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-11 16:00:35,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-11 16:00:35,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-11 16:00:35,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-11 16:00:35,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-11 16:00:35,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-11 16:00:35,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-11 16:00:36,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-11 16:00:36,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-11 16:00:36,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-11 16:00:36,291 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-11 16:00:36,291 INFO L275 PluginConnector]: CDTParser initialized [2020-09-11 16:00:36,293 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-09-11 16:00:36,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3ea44f907/ca8397eeb79c4f71ac6496e983da7198/FLAG05eec0c2c [2020-09-11 16:00:37,096 INFO L306 CDTParser]: Found 1 translation units. [2020-09-11 16:00:37,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-09-11 16:00:37,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3ea44f907/ca8397eeb79c4f71ac6496e983da7198/FLAG05eec0c2c [2020-09-11 16:00:37,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3ea44f907/ca8397eeb79c4f71ac6496e983da7198 [2020-09-11 16:00:37,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-11 16:00:37,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-11 16:00:37,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-11 16:00:37,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-11 16:00:37,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-11 16:00:37,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 04:00:37" (1/1) ... [2020-09-11 16:00:37,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6d5a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:37, skipping insertion in model container [2020-09-11 16:00:37,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 04:00:37" (1/1) ... [2020-09-11 16:00:37,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-11 16:00:37,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-11 16:00:38,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 16:00:38,314 INFO L203 MainTranslator]: Completed pre-run [2020-09-11 16:00:38,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 16:00:38,895 INFO L208 MainTranslator]: Completed translation [2020-09-11 16:00:38,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38 WrapperNode [2020-09-11 16:00:38,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-11 16:00:38,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-11 16:00:38,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-11 16:00:38,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-11 16:00:38,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:38,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-11 16:00:39,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-11 16:00:39,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-11 16:00:39,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-11 16:00:39,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... [2020-09-11 16:00:39,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-11 16:00:39,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-11 16:00:39,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-11 16:00:39,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-11 16:00:39,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-11 16:00:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-11 16:00:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-11 16:00:39,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-11 16:00:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-11 16:00:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-11 16:00:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-11 16:00:39,157 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-11 16:00:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-11 16:00:39,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-11 16:00:39,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-11 16:00:39,160 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-11 16:00:39,872 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-11 16:00:39,873 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-11 16:00:39,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 04:00:39 BoogieIcfgContainer [2020-09-11 16:00:39,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-11 16:00:39,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-11 16:00:39,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-11 16:00:39,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-11 16:00:39,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 04:00:37" (1/3) ... [2020-09-11 16:00:39,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358f62b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 04:00:39, skipping insertion in model container [2020-09-11 16:00:39,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 04:00:38" (2/3) ... [2020-09-11 16:00:39,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358f62b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 04:00:39, skipping insertion in model container [2020-09-11 16:00:39,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 04:00:39" (3/3) ... [2020-09-11 16:00:39,888 INFO L109 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-09-11 16:00:39,900 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-11 16:00:39,900 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-11 16:00:39,911 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-09-11 16:00:39,912 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-11 16:00:39,945 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,945 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,945 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,946 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,946 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,946 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,946 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,947 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,947 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,947 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,947 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,947 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,948 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,948 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,949 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,949 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,949 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,949 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,950 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,950 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,950 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,950 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,951 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,952 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,953 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,953 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,953 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,953 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,954 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,954 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,954 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,954 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,955 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,955 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,955 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,959 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,960 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,960 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,960 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,961 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,961 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,961 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,961 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,961 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,969 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,969 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,970 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,970 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,970 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,970 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,971 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,971 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:39,971 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 16:00:40,006 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-11 16:00:40,034 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 16:00:40,034 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 16:00:40,034 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 16:00:40,034 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 16:00:40,034 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 16:00:40,035 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 16:00:40,035 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 16:00:40,035 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 16:00:40,055 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 148 transitions, 318 flow [2020-09-11 16:00:40,058 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-09-11 16:00:40,141 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-09-11 16:00:40,141 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-11 16:00:40,149 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-09-11 16:00:40,154 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-09-11 16:00:40,201 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-09-11 16:00:40,201 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-11 16:00:40,202 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-09-11 16:00:40,206 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1980 [2020-09-11 16:00:40,207 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 16:00:40,623 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:40,666 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:40,694 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,694 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:40,711 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:40,744 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:40,767 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:40,767 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:43,325 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,351 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,379 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,379 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-11 16:00:43,791 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,852 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,882 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,883 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:43,898 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,931 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,936 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:43,965 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:43,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-11 16:00:46,001 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:46,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:46,038 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:46,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:46,073 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:46,073 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:46,092 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:46,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:46,120 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:46,150 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:46,151 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:46,152 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:48,194 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,234 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,266 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,266 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:48,281 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,314 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:48,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:48,339 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-11 16:00:51,579 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:51,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:51,603 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:51,619 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:51,620 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:51,622 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-11 16:00:52,216 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-09-11 16:00:52,704 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,740 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,760 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,760 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-09-11 16:00:52,801 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,852 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,885 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,886 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:127 [2020-09-11 16:00:52,903 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,957 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:52,995 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:52,995 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:129 [2020-09-11 16:00:55,018 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:55,060 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:55,069 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:55,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:55,102 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:55,102 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-09-11 16:00:55,115 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:55,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:55,154 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:55,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:00:55,183 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-11 16:00:55,184 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-11 16:00:58,030 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-09-11 16:00:58,403 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-09-11 16:00:59,024 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-09-11 16:00:59,256 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-09-11 16:00:59,942 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-09-11 16:01:00,209 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-11 16:01:01,370 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-09-11 16:01:01,405 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:01,947 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-09-11 16:01:01,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:01,958 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-11 16:01:02,452 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-11 16:01:02,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-11 16:01:02,453 INFO L545 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-09-11 16:01:02,454 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-09-11 16:01:02,971 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-09-11 16:01:02,981 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2994 [2020-09-11 16:01:02,981 INFO L214 etLargeBlockEncoding]: Total number of compositions: 159 [2020-09-11 16:01:02,985 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 90 flow [2020-09-11 16:01:03,005 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 192 states. [2020-09-11 16:01:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2020-09-11 16:01:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-09-11 16:01:03,017 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:03,018 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-09-11 16:01:03,018 INFO L427 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-09-11 16:01:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-09-11 16:01:03,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:03,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200354434] [2020-09-11 16:01:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:03,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200354434] [2020-09-11 16:01:03,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:03,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-09-11 16:01:03,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048788350] [2020-09-11 16:01:03,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-11 16:01:03,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-11 16:01:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-11 16:01:03,354 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 2 states. [2020-09-11 16:01:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:03,383 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2020-09-11 16:01:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-11 16:01:03,385 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-09-11 16:01:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:03,401 INFO L225 Difference]: With dead ends: 190 [2020-09-11 16:01:03,401 INFO L226 Difference]: Without dead ends: 172 [2020-09-11 16:01:03,403 INFO L675 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-09-11 16:01:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-11 16:01:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-09-11 16:01:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-09-11 16:01:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 374 transitions. [2020-09-11 16:01:03,469 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 374 transitions. Word has length 1 [2020-09-11 16:01:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:03,470 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 374 transitions. [2020-09-11 16:01:03,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-11 16:01:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 374 transitions. [2020-09-11 16:01:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-11 16:01:03,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:03,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-11 16:01:03,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-11 16:01:03,471 INFO L427 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-09-11 16:01:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash 16594450, now seen corresponding path program 1 times [2020-09-11 16:01:03,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:03,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557416404] [2020-09-11 16:01:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:03,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557416404] [2020-09-11 16:01:03,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:03,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 16:01:03,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201655287] [2020-09-11 16:01:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 16:01:03,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 16:01:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 16:01:03,753 INFO L87 Difference]: Start difference. First operand 172 states and 374 transitions. Second operand 3 states. [2020-09-11 16:01:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:03,891 INFO L93 Difference]: Finished difference Result 230 states and 503 transitions. [2020-09-11 16:01:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 16:01:03,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-11 16:01:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:03,897 INFO L225 Difference]: With dead ends: 230 [2020-09-11 16:01:03,897 INFO L226 Difference]: Without dead ends: 230 [2020-09-11 16:01:03,898 INFO L675 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-09-11 16:01:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-09-11 16:01:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-09-11 16:01:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-11 16:01:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-09-11 16:01:03,919 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-09-11 16:01:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:03,920 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-09-11 16:01:03,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 16:01:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-09-11 16:01:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-11 16:01:03,920 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:03,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-11 16:01:03,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-11 16:01:03,921 INFO L427 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-09-11 16:01:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash 514428411, now seen corresponding path program 1 times [2020-09-11 16:01:03,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:03,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423024596] [2020-09-11 16:01:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:04,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423024596] [2020-09-11 16:01:04,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:04,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 16:01:04,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434887189] [2020-09-11 16:01:04,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 16:01:04,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:04,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 16:01:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 16:01:04,099 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-09-11 16:01:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:04,226 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-09-11 16:01:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 16:01:04,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-11 16:01:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:04,231 INFO L225 Difference]: With dead ends: 243 [2020-09-11 16:01:04,231 INFO L226 Difference]: Without dead ends: 236 [2020-09-11 16:01:04,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09-11 16:01:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-09-11 16:01:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-09-11 16:01:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-09-11 16:01:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-09-11 16:01:04,271 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-09-11 16:01:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:04,272 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-09-11 16:01:04,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 16:01:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-09-11 16:01:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 16:01:04,278 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:04,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:04,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-11 16:01:04,279 INFO L427 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-09-11 16:01:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1038453307, now seen corresponding path program 1 times [2020-09-11 16:01:04,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:04,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935338814] [2020-09-11 16:01:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:04,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935338814] [2020-09-11 16:01:04,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:04,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 16:01:04,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258853644] [2020-09-11 16:01:04,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 16:01:04,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 16:01:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 16:01:04,432 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-09-11 16:01:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:04,452 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-09-11 16:01:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 16:01:04,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-09-11 16:01:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:04,454 INFO L225 Difference]: With dead ends: 86 [2020-09-11 16:01:04,454 INFO L226 Difference]: Without dead ends: 86 [2020-09-11 16:01:04,455 INFO L675 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-09-11 16:01:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-11 16:01:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-11 16:01:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-11 16:01:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-09-11 16:01:04,467 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-09-11 16:01:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:04,468 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-09-11 16:01:04,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 16:01:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-09-11 16:01:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:04,471 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:04,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:04,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-11 16:01:04,471 INFO L427 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-09-11 16:01:04,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash 82727147, now seen corresponding path program 1 times [2020-09-11 16:01:04,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:04,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043192691] [2020-09-11 16:01:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:04,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043192691] [2020-09-11 16:01:04,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:04,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:01:04,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040116142] [2020-09-11 16:01:04,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 16:01:04,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 16:01:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:01:04,913 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 7 states. [2020-09-11 16:01:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:05,319 INFO L93 Difference]: Finished difference Result 145 states and 268 transitions. [2020-09-11 16:01:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 16:01:05,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-11 16:01:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:05,322 INFO L225 Difference]: With dead ends: 145 [2020-09-11 16:01:05,322 INFO L226 Difference]: Without dead ends: 145 [2020-09-11 16:01:05,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-11 16:01:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2020-09-11 16:01:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-11 16:01:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 191 transitions. [2020-09-11 16:01:05,328 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 191 transitions. Word has length 18 [2020-09-11 16:01:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:05,328 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 191 transitions. [2020-09-11 16:01:05,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 16:01:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 191 transitions. [2020-09-11 16:01:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:05,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:05,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:05,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-11 16:01:05,331 INFO L427 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-09-11 16:01:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 82727169, now seen corresponding path program 1 times [2020-09-11 16:01:05,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:05,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534059874] [2020-09-11 16:01:05,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:06,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534059874] [2020-09-11 16:01:06,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:06,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:06,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927275347] [2020-09-11 16:01:06,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:06,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:06,063 INFO L87 Difference]: Start difference. First operand 103 states and 191 transitions. Second operand 12 states. [2020-09-11 16:01:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:06,985 INFO L93 Difference]: Finished difference Result 157 states and 266 transitions. [2020-09-11 16:01:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:06,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-11 16:01:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:06,987 INFO L225 Difference]: With dead ends: 157 [2020-09-11 16:01:06,987 INFO L226 Difference]: Without dead ends: 136 [2020-09-11 16:01:06,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-11 16:01:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-09-11 16:01:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2020-09-11 16:01:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-11 16:01:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 190 transitions. [2020-09-11 16:01:06,992 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 190 transitions. Word has length 18 [2020-09-11 16:01:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:06,993 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 190 transitions. [2020-09-11 16:01:06,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 190 transitions. [2020-09-11 16:01:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:07,000 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:07,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:07,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-11 16:01:07,001 INFO L427 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-09-11 16:01:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555757, now seen corresponding path program 2 times [2020-09-11 16:01:07,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:07,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581535256] [2020-09-11 16:01:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:07,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581535256] [2020-09-11 16:01:07,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:07,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:01:07,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393181917] [2020-09-11 16:01:07,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 16:01:07,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:07,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 16:01:07,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:01:07,405 INFO L87 Difference]: Start difference. First operand 103 states and 190 transitions. Second operand 7 states. [2020-09-11 16:01:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:07,705 INFO L93 Difference]: Finished difference Result 158 states and 276 transitions. [2020-09-11 16:01:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 16:01:07,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-11 16:01:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:07,707 INFO L225 Difference]: With dead ends: 158 [2020-09-11 16:01:07,708 INFO L226 Difference]: Without dead ends: 158 [2020-09-11 16:01:07,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-09-11 16:01:07,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2020-09-11 16:01:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-11 16:01:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 200 transitions. [2020-09-11 16:01:07,713 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 200 transitions. Word has length 18 [2020-09-11 16:01:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:07,714 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 200 transitions. [2020-09-11 16:01:07,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 16:01:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 200 transitions. [2020-09-11 16:01:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:07,717 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:07,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:07,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-11 16:01:07,718 INFO L427 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-09-11 16:01:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2133555779, now seen corresponding path program 2 times [2020-09-11 16:01:07,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:07,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659878986] [2020-09-11 16:01:07,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:08,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659878986] [2020-09-11 16:01:08,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:08,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:08,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025422393] [2020-09-11 16:01:08,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:08,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:08,397 INFO L87 Difference]: Start difference. First operand 109 states and 200 transitions. Second operand 12 states. [2020-09-11 16:01:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:09,229 INFO L93 Difference]: Finished difference Result 137 states and 235 transitions. [2020-09-11 16:01:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 16:01:09,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-11 16:01:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:09,232 INFO L225 Difference]: With dead ends: 137 [2020-09-11 16:01:09,232 INFO L226 Difference]: Without dead ends: 126 [2020-09-11 16:01:09,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-09-11 16:01:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-09-11 16:01:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-09-11 16:01:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-11 16:01:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 196 transitions. [2020-09-11 16:01:09,251 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 196 transitions. Word has length 18 [2020-09-11 16:01:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:09,251 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 196 transitions. [2020-09-11 16:01:09,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 196 transitions. [2020-09-11 16:01:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:09,252 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:09,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:09,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-11 16:01:09,252 INFO L427 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-09-11 16:01:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1342972915, now seen corresponding path program 3 times [2020-09-11 16:01:09,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:09,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955215901] [2020-09-11 16:01:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:09,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955215901] [2020-09-11 16:01:09,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:09,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:09,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511192521] [2020-09-11 16:01:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:09,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:09,962 INFO L87 Difference]: Start difference. First operand 107 states and 196 transitions. Second operand 12 states. [2020-09-11 16:01:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:10,911 INFO L93 Difference]: Finished difference Result 139 states and 238 transitions. [2020-09-11 16:01:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:01:10,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-11 16:01:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:10,913 INFO L225 Difference]: With dead ends: 139 [2020-09-11 16:01:10,913 INFO L226 Difference]: Without dead ends: 124 [2020-09-11 16:01:10,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-11 16:01:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-11 16:01:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2020-09-11 16:01:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-11 16:01:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 192 transitions. [2020-09-11 16:01:10,919 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 192 transitions. Word has length 18 [2020-09-11 16:01:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:10,919 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 192 transitions. [2020-09-11 16:01:10,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 192 transitions. [2020-09-11 16:01:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:10,920 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:10,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:10,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-11 16:01:10,920 INFO L427 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-09-11 16:01:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1672062081, now seen corresponding path program 4 times [2020-09-11 16:01:10,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:10,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238627990] [2020-09-11 16:01:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:11,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238627990] [2020-09-11 16:01:11,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:11,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 16:01:11,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407005687] [2020-09-11 16:01:11,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 16:01:11,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 16:01:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-11 16:01:11,548 INFO L87 Difference]: Start difference. First operand 105 states and 192 transitions. Second operand 12 states. [2020-09-11 16:01:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:12,410 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-09-11 16:01:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:12,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2020-09-11 16:01:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:12,412 INFO L225 Difference]: With dead ends: 136 [2020-09-11 16:01:12,412 INFO L226 Difference]: Without dead ends: 113 [2020-09-11 16:01:12,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-09-11 16:01:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-11 16:01:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2020-09-11 16:01:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-11 16:01:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2020-09-11 16:01:12,416 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 18 [2020-09-11 16:01:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:12,417 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2020-09-11 16:01:12,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 16:01:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2020-09-11 16:01:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:12,417 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:12,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:12,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-11 16:01:12,418 INFO L427 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-09-11 16:01:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash -285831053, now seen corresponding path program 5 times [2020-09-11 16:01:12,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:12,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741339366] [2020-09-11 16:01:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:12,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741339366] [2020-09-11 16:01:12,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:12,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 16:01:12,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735992379] [2020-09-11 16:01:12,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:12,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:12,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:12,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:12,968 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2020-09-11 16:01:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:13,603 INFO L93 Difference]: Finished difference Result 153 states and 270 transitions. [2020-09-11 16:01:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:13,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-09-11 16:01:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:13,605 INFO L225 Difference]: With dead ends: 153 [2020-09-11 16:01:13,605 INFO L226 Difference]: Without dead ends: 132 [2020-09-11 16:01:13,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-11 16:01:13,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-09-11 16:01:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2020-09-11 16:01:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-11 16:01:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2020-09-11 16:01:13,610 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 18 [2020-09-11 16:01:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:13,610 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2020-09-11 16:01:13,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2020-09-11 16:01:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:13,611 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:13,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:13,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-11 16:01:13,611 INFO L427 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-09-11 16:01:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 311067317, now seen corresponding path program 3 times [2020-09-11 16:01:13,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:13,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912261923] [2020-09-11 16:01:13,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 16:01:13,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912261923] [2020-09-11 16:01:13,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:01:13,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 16:01:13,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290369899] [2020-09-11 16:01:13,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:01:13,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:01:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:01:13,987 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 9 states. [2020-09-11 16:01:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:14,541 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2020-09-11 16:01:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 16:01:14,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-09-11 16:01:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:14,544 INFO L225 Difference]: With dead ends: 229 [2020-09-11 16:01:14,544 INFO L226 Difference]: Without dead ends: 229 [2020-09-11 16:01:14,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-09-11 16:01:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-09-11 16:01:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 123. [2020-09-11 16:01:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-09-11 16:01:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 223 transitions. [2020-09-11 16:01:14,550 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 223 transitions. Word has length 18 [2020-09-11 16:01:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:14,550 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 223 transitions. [2020-09-11 16:01:14,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:01:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 223 transitions. [2020-09-11 16:01:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 16:01:14,551 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:14,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:14,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-11 16:01:14,552 INFO L427 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-09-11 16:01:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash 311067339, now seen corresponding path program 6 times [2020-09-11 16:01:14,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:14,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007096145] [2020-09-11 16:01:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 16:01:14,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 16:01:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 16:01:14,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 16:01:14,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 16:01:14,695 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 16:01:14,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-11 16:01:14,696 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 16:01:14,696 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 16:01:14,697 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 16:01:14,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L1706-->L1708-2: Formula: (let ((.cse0 (select |#memory_int_In-187055374| ULTIMATE.start_my_drv_probe_~data.base_In-187055374))) (and (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-187055374 28)) |ULTIMATE.start_my_drv_probe_#t~mem32_Out-187055374|) (= ULTIMATE.start_ldv_assert_~expression_Out-187055374 1) (let ((.cse1 (= |ULTIMATE.start_my_drv_probe_#t~mem32_Out-187055374| 0))) (or (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-187055374| 1) .cse1) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-187055374| 0) (not .cse1)))) (= (select .cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_In-187055374 24)) 0))) InVars {ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-187055374, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-187055374, #memory_int=|#memory_int_In-187055374|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-187055374|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-187055374|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_In-187055374, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_In-187055374, #memory_int=|#memory_int_In-187055374|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-187055374|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-187055374} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-11 16:01:14,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L1708-2-->L1709-1: Formula: (and (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In89675518| 2147483647) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In89675518| 2147483648)) (not (= ULTIMATE.start_ldv_assert_~expression_Out89675518 0)) (= |ULTIMATE.start_ldv_assert_#in~expression_In89675518| ULTIMATE.start_ldv_assert_~expression_Out89675518)) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In89675518|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In89675518|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out89675518|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In89675518|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In89675518|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out89675518} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-11 16:01:14,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [498] [498] L1721-3-->L1741-2: Formula: (let ((.cse0 (select |#memory_int_In-1727293588| |ULTIMATE.start_main_~#data~1.base_In-1727293588|))) (and (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In-1727293588| 24)) 1) (= ULTIMATE.start_ldv_assert_~expression_Out-1727293588 1) (= (select .cse0 (+ |ULTIMATE.start_main_~#data~1.offset_In-1727293588| 28)) |ULTIMATE.start_main_#t~mem43_Out-1727293588|) (let ((.cse1 (= 2 |ULTIMATE.start_main_#t~mem43_Out-1727293588|))) (or (and .cse1 (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1727293588| 1)) (and (= |ULTIMATE.start_ldv_assert_#in~expression_Out-1727293588| 0) (not .cse1)))))) InVars {#memory_int=|#memory_int_In-1727293588|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In-1727293588|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In-1727293588|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out-1727293588|, ULTIMATE.start_my_drv_disconnect_~#status~0.offset=|ULTIMATE.start_my_drv_disconnect_~#status~0.offset_Out-1727293588|, ULTIMATE.start_my_drv_disconnect_~#status~0.base=|ULTIMATE.start_my_drv_disconnect_~#status~0.base_Out-1727293588|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out-1727293588|, #memory_int=|#memory_int_In-1727293588|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In-1727293588|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-1727293588|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In-1727293588|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1727293588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_my_drv_disconnect_~#status~0.offset, ULTIMATE.start_my_drv_disconnect_~#status~0.base, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-11 16:01:14,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 04:01:14 BasicIcfg [2020-09-11 16:01:14,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-11 16:01:14,770 INFO L168 Benchmark]: Toolchain (without parser) took 37438.42 ms. Allocated memory was 143.1 MB in the beginning and 403.2 MB in the end (delta: 260.0 MB). Free memory was 95.7 MB in the beginning and 220.6 MB in the end (delta: -125.0 MB). Peak memory consumption was 135.1 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,771 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 143.1 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1557.97 ms. Allocated memory was 143.1 MB in the beginning and 227.5 MB in the end (delta: 84.4 MB). Free memory was 95.0 MB in the beginning and 164.6 MB in the end (delta: -69.5 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.81 ms. Allocated memory is still 227.5 MB. Free memory was 164.6 MB in the beginning and 161.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,773 INFO L168 Benchmark]: Boogie Preprocessor took 66.16 ms. Allocated memory is still 227.5 MB. Free memory was 161.7 MB in the beginning and 158.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,774 INFO L168 Benchmark]: RCFGBuilder took 806.52 ms. Allocated memory is still 227.5 MB. Free memory was 158.7 MB in the beginning and 110.7 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,775 INFO L168 Benchmark]: TraceAbstraction took 34888.21 ms. Allocated memory was 227.5 MB in the beginning and 403.2 MB in the end (delta: 175.6 MB). Free memory was 110.7 MB in the beginning and 220.6 MB in the end (delta: -110.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:14,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 143.1 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1557.97 ms. Allocated memory was 143.1 MB in the beginning and 227.5 MB in the end (delta: 84.4 MB). Free memory was 95.0 MB in the beginning and 164.6 MB in the end (delta: -69.5 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 107.81 ms. Allocated memory is still 227.5 MB. Free memory was 164.6 MB in the beginning and 161.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.16 ms. Allocated memory is still 227.5 MB. Free memory was 161.7 MB in the beginning and 158.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.52 ms. Allocated memory is still 227.5 MB. Free memory was 158.7 MB in the beginning and 110.7 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34888.21 ms. Allocated memory was 227.5 MB in the beginning and 403.2 MB in the end (delta: 175.6 MB). Free memory was 110.7 MB in the beginning and 220.6 MB in the end (delta: -110.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 22.9s, 144 ProgramPointsBefore, 36 ProgramPointsAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 996 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 6 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 13.6s, 0 MoverChecksTotal, 2994 CheckedPairsTotal, 159 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1695] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 1 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, data->shared.b=0, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 34.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.9s, HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 920 SDs, 0 SdLazy, 2258 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 356 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 47943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 incorrect! Received shutdown request...