/usr/bin/java -Xmx16000000000 -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-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:25:47,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:25:47,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:25:47,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:25:47,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:25:47,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:25:47,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:25:47,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:25:47,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:25:47,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:25:47,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:25:47,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:25:47,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:25:47,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:25:47,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:25:47,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:25:47,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:25:47,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:25:47,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:25:47,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:25:47,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:25:47,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:25:47,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:25:47,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:25:47,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:25:47,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:25:47,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:25:47,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:25:47,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:25:47,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:25:47,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:25:47,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:25:47,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:25:47,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:25:47,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:25:47,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:25:47,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:25:47,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:25:47,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:25:47,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:25:47,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:25:47,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:25:48,025 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:25:48,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:25:48,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:25:48,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:25:48,028 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:25:48,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:25:48,028 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:25:48,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:25:48,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:25:48,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:25:48,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:25:48,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:25:48,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:25:48,030 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:25:48,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:25:48,031 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:25:48,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:25:48,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:25:48,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:25:48,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:25:48,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:25:48,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:25:48,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:25:48,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:25:48,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:25:48,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:25:48,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:25:48,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:25:48,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:25:48,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:25:48,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:25:48,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:25:48,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:25:48,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:25:48,331 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:25:48,332 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-11 15:25:48,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc0a92ee/aaa7cb8094c746f5952a7166a89a74b4/FLAGb1309df2e [2020-10-11 15:25:49,007 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:25:49,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-11 15:25:49,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc0a92ee/aaa7cb8094c746f5952a7166a89a74b4/FLAGb1309df2e [2020-10-11 15:25:49,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc0a92ee/aaa7cb8094c746f5952a7166a89a74b4 [2020-10-11 15:25:49,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:25:49,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:25:49,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:25:49,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:25:49,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:25:49,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1422f050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:49, skipping insertion in model container [2020-10-11 15:25:49,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:49" (1/1) ... [2020-10-11 15:25:49,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:25:49,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:25:50,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:25:50,124 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:25:50,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:25:50,585 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:25:50,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50 WrapperNode [2020-10-11 15:25:50,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:25:50,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:25:50,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:25:50,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:25:50,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:25:50,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:25:50,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:25:50,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:25:50,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... [2020-10-11 15:25:50,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:25:50,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:25:50,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:25:50,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:25:50,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 15:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-11 15:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:25:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-11 15:25:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-11 15:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-11 15:25:50,802 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:25:51,407 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:25:51,408 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-11 15:25:51,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:51 BoogieIcfgContainer [2020-10-11 15:25:51,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:25:51,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:25:51,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:25:51,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:25:51,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:25:49" (1/3) ... [2020-10-11 15:25:51,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a03e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:51, skipping insertion in model container [2020-10-11 15:25:51,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:50" (2/3) ... [2020-10-11 15:25:51,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a03e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:51, skipping insertion in model container [2020-10-11 15:25:51,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:51" (3/3) ... [2020-10-11 15:25:51,419 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-10-11 15:25:51,430 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:25:51,430 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:25:51,438 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-10-11 15:25:51,439 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:25:51,467 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,468 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,468 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,468 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,468 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,469 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,469 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,469 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,469 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,469 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,469 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,470 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,470 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,470 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,470 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,470 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,471 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,472 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,472 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,472 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,473 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,473 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,473 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,474 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,474 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,474 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,475 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,476 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,476 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,476 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,476 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,476 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,477 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,478 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,478 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,478 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,479 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,479 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,479 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,483 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,483 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,484 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,484 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,485 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,485 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,494 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,494 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,495 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,495 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,496 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,496 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:25:51,519 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 15:25:51,538 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:25:51,538 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:25:51,538 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:25:51,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:25:51,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:25:51,539 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:25:51,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:25:51,539 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:25:51,556 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:25:51,558 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 284 flow [2020-10-11 15:25:51,561 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 131 transitions, 284 flow [2020-10-11 15:25:51,563 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-10-11 15:25:51,629 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-10-11 15:25:51,630 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-11 15:25:51,635 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-10-11 15:25:51,640 INFO L117 LiptonReduction]: Number of co-enabled transitions 2200 [2020-10-11 15:25:52,268 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:52,294 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,311 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:52,313 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,314 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-11 15:25:52,345 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,374 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:52,379 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:52,402 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,402 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-11 15:25:52,418 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:52,450 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:52,473 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:52,473 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-11 15:25:54,585 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:54,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:54,615 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:54,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:54,641 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:54,641 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:25:54,658 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:54,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:54,688 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:54,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:54,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:54,712 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:25:56,913 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:56,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:56,943 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:56,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:56,964 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:56,964 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:25:56,977 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:57,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:57,005 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:57,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:57,033 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:57,034 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:25:59,074 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:59,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:59,103 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:59,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:59,124 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:59,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:25:59,140 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:59,166 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:59,171 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:59,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:25:59,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:25:59,195 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:01,275 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:01,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:01,317 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:01,347 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:01,348 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:01,349 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:01,363 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:01,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:01,405 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:01,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:01,434 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:01,434 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:03,491 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:03,529 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,553 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:03,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,555 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-11 15:26:03,571 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:03,608 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:03,641 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:03,642 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:110 [2020-10-11 15:26:04,166 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:04,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:04,199 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:04,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:04,224 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:04,225 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:04,238 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:04,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:04,268 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:04,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:04,327 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:04,327 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-11 15:26:06,516 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:06,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:06,571 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:06,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:06,628 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:06,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:128 [2020-10-11 15:26:06,644 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:06,694 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:06,698 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:06,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:06,746 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:06,746 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:130 [2020-10-11 15:26:09,230 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,252 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,256 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,278 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,278 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-11 15:26:09,315 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,336 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,341 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,361 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:09,375 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,404 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:09,428 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:09,428 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-11 15:26:11,452 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:11,490 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:11,515 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,516 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-11 15:26:11,526 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:11,565 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:11,590 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:11,591 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-11 15:26:13,621 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:13,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:13,659 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:13,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:13,686 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:13,686 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-11 15:26:13,712 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:13,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:13,754 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:13,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:13,784 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:13,785 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-11 15:26:16,028 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,050 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,053 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,079 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,080 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-11 15:26:16,096 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,131 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,163 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:16,164 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:16,164 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-11 15:26:18,656 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-11 15:26:18,678 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:18,755 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:18,833 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:18,834 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-10-11 15:26:18,834 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-10-11 15:26:19,002 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:19,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:19,042 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:19,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:19,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-10-11 15:26:19,074 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-11 15:26:19,088 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:19,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:19,129 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:19,159 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:19,161 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:19,161 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-11 15:26:21,589 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:21,646 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:21,693 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,694 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-10-11 15:26:21,705 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,773 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:21,778 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-11 15:26:21,825 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-11 15:26:21,825 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-10-11 15:26:24,051 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-10-11 15:26:25,088 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-11 15:26:25,579 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-11 15:26:25,792 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-11 15:26:26,018 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-11 15:26:26,208 INFO L132 LiptonReduction]: Checked pairs total: 4067 [2020-10-11 15:26:26,208 INFO L134 LiptonReduction]: Total number of compositions: 138 [2020-10-11 15:26:26,215 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-10-11 15:26:26,233 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 190 states. [2020-10-11 15:26:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-10-11 15:26:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-11 15:26:26,241 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:26,242 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-11 15:26:26,243 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash 14364445, now seen corresponding path program 1 times [2020-10-11 15:26:26,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:26,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755209829] [2020-10-11 15:26:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:26,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755209829] [2020-10-11 15:26:26,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:26,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:26:26,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796425904] [2020-10-11 15:26:26,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:26:26,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:26:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:26:26,658 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 3 states. [2020-10-11 15:26:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:26,797 INFO L93 Difference]: Finished difference Result 248 states and 560 transitions. [2020-10-11 15:26:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:26:26,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-11 15:26:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:26,814 INFO L225 Difference]: With dead ends: 248 [2020-10-11 15:26:26,814 INFO L226 Difference]: Without dead ends: 230 [2020-10-11 15:26:26,815 INFO L673 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-10-11 15:26:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-11 15:26:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-11 15:26:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-11 15:26:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-11 15:26:26,879 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-11 15:26:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:26,880 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-11 15:26:26,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:26:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-11 15:26:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 15:26:26,881 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:26,881 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 15:26:26,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:26:26,881 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash 445298819, now seen corresponding path program 1 times [2020-10-11 15:26:26,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:26,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257714471] [2020-10-11 15:26:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:26,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257714471] [2020-10-11 15:26:26,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:26,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:26:26,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088955797] [2020-10-11 15:26:26,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:26:26,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:26,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:26:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:26:26,970 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-11 15:26:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:27,055 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-11 15:26:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:26:27,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 15:26:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:27,058 INFO L225 Difference]: With dead ends: 243 [2020-10-11 15:26:27,058 INFO L226 Difference]: Without dead ends: 236 [2020-10-11 15:26:27,059 INFO L673 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-10-11 15:26:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-11 15:26:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-11 15:26:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-11 15:26:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-11 15:26:27,081 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-11 15:26:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:27,081 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-11 15:26:27,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:26:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-11 15:26:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:26:27,083 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:27,083 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:27,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:26:27,083 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1770707455, now seen corresponding path program 1 times [2020-10-11 15:26:27,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:27,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694550881] [2020-10-11 15:26:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:27,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694550881] [2020-10-11 15:26:27,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:27,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:26:27,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239007886] [2020-10-11 15:26:27,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:26:27,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:26:27,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:26:27,159 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-11 15:26:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:27,171 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-11 15:26:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:26:27,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-11 15:26:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:27,173 INFO L225 Difference]: With dead ends: 86 [2020-10-11 15:26:27,173 INFO L226 Difference]: Without dead ends: 86 [2020-10-11 15:26:27,173 INFO L673 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-10-11 15:26:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-11 15:26:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-11 15:26:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-11 15:26:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-11 15:26:27,179 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-11 15:26:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:27,180 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-11 15:26:27,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:26:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-11 15:26:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:27,181 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:27,181 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:27,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:26:27,182 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1268591532, now seen corresponding path program 1 times [2020-10-11 15:26:27,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:27,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769637668] [2020-10-11 15:26:27,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:27,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769637668] [2020-10-11 15:26:27,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:27,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:27,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821341041] [2020-10-11 15:26:27,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:26:27,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:27,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:26:27,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:26:27,546 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 13 states. [2020-10-11 15:26:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:28,497 INFO L93 Difference]: Finished difference Result 86 states and 166 transitions. [2020-10-11 15:26:28,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 15:26:28,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-11 15:26:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:28,499 INFO L225 Difference]: With dead ends: 86 [2020-10-11 15:26:28,499 INFO L226 Difference]: Without dead ends: 74 [2020-10-11 15:26:28,500 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2020-10-11 15:26:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-11 15:26:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-11 15:26:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-11 15:26:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 145 transitions. [2020-10-11 15:26:28,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 145 transitions. Word has length 18 [2020-10-11 15:26:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:28,507 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 145 transitions. [2020-10-11 15:26:28,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:26:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 145 transitions. [2020-10-11 15:26:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:28,508 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:28,508 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:28,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:26:28,508 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:28,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219722, now seen corresponding path program 1 times [2020-10-11 15:26:28,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:28,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055423695] [2020-10-11 15:26:28,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:28,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055423695] [2020-10-11 15:26:28,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:28,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:26:28,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538466356] [2020-10-11 15:26:28,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:26:28,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:26:28,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:26:28,853 INFO L87 Difference]: Start difference. First operand 74 states and 145 transitions. Second operand 8 states. [2020-10-11 15:26:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:29,155 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-10-11 15:26:29,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:26:29,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-11 15:26:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:29,156 INFO L225 Difference]: With dead ends: 117 [2020-10-11 15:26:29,156 INFO L226 Difference]: Without dead ends: 117 [2020-10-11 15:26:29,157 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:26:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-11 15:26:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-10-11 15:26:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-11 15:26:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-11 15:26:29,170 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-11 15:26:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:29,170 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-11 15:26:29,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:26:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-11 15:26:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:29,175 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:29,175 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:29,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:26:29,176 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219740, now seen corresponding path program 1 times [2020-10-11 15:26:29,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:29,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82779986] [2020-10-11 15:26:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:30,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82779986] [2020-10-11 15:26:30,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:30,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:30,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398105438] [2020-10-11 15:26:30,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:30,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:30,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:30,090 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 14 states. [2020-10-11 15:26:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:31,058 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2020-10-11 15:26:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:26:31,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:31,060 INFO L225 Difference]: With dead ends: 153 [2020-10-11 15:26:31,060 INFO L226 Difference]: Without dead ends: 145 [2020-10-11 15:26:31,061 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-10-11 15:26:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-11 15:26:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2020-10-11 15:26:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-11 15:26:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2020-10-11 15:26:31,067 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 18 [2020-10-11 15:26:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:31,067 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2020-10-11 15:26:31,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2020-10-11 15:26:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:31,068 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:31,068 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:31,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:26:31,069 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1046484834, now seen corresponding path program 2 times [2020-10-11 15:26:31,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:31,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380177280] [2020-10-11 15:26:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:31,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380177280] [2020-10-11 15:26:31,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:31,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:31,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274436857] [2020-10-11 15:26:31,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:31,870 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 14 states. [2020-10-11 15:26:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:32,984 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2020-10-11 15:26:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 15:26:32,985 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:32,987 INFO L225 Difference]: With dead ends: 155 [2020-10-11 15:26:32,987 INFO L226 Difference]: Without dead ends: 143 [2020-10-11 15:26:32,988 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-11 15:26:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-11 15:26:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2020-10-11 15:26:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-11 15:26:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 181 transitions. [2020-10-11 15:26:32,993 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 181 transitions. Word has length 18 [2020-10-11 15:26:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:32,993 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 181 transitions. [2020-10-11 15:26:32,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 181 transitions. [2020-10-11 15:26:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:32,994 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:32,995 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:32,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:26:32,995 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1347055900, now seen corresponding path program 3 times [2020-10-11 15:26:32,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:32,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791360002] [2020-10-11 15:26:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:33,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791360002] [2020-10-11 15:26:33,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:33,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:33,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517257982] [2020-10-11 15:26:33,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:33,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:33,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:33,811 INFO L87 Difference]: Start difference. First operand 98 states and 181 transitions. Second operand 14 states. [2020-10-11 15:26:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:34,805 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2020-10-11 15:26:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:26:34,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:34,808 INFO L225 Difference]: With dead ends: 139 [2020-10-11 15:26:34,808 INFO L226 Difference]: Without dead ends: 123 [2020-10-11 15:26:34,809 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-11 15:26:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-11 15:26:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2020-10-11 15:26:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-11 15:26:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-11 15:26:34,813 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-11 15:26:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:34,813 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-11 15:26:34,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-11 15:26:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:34,814 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:34,814 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:34,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:26:34,815 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash 646402192, now seen corresponding path program 2 times [2020-10-11 15:26:34,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:34,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077456591] [2020-10-11 15:26:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:35,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077456591] [2020-10-11 15:26:35,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:35,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 15:26:35,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284389675] [2020-10-11 15:26:35,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 15:26:35,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 15:26:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:26:35,063 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 8 states. [2020-10-11 15:26:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:35,415 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2020-10-11 15:26:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:26:35,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-11 15:26:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:35,419 INFO L225 Difference]: With dead ends: 119 [2020-10-11 15:26:35,419 INFO L226 Difference]: Without dead ends: 119 [2020-10-11 15:26:35,420 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:26:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-11 15:26:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2020-10-11 15:26:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-11 15:26:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-11 15:26:35,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-11 15:26:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:35,425 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-11 15:26:35,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 15:26:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-11 15:26:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:35,427 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:35,428 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:35,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:26:35,428 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:35,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:35,428 INFO L82 PathProgramCache]: Analyzing trace with hash 646402210, now seen corresponding path program 4 times [2020-10-11 15:26:35,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:35,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326641149] [2020-10-11 15:26:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:36,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326641149] [2020-10-11 15:26:36,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:36,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:36,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9938263] [2020-10-11 15:26:36,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:36,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:36,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:36,169 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 14 states. [2020-10-11 15:26:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:37,157 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2020-10-11 15:26:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:26:37,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:37,159 INFO L225 Difference]: With dead ends: 135 [2020-10-11 15:26:37,159 INFO L226 Difference]: Without dead ends: 113 [2020-10-11 15:26:37,161 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-11 15:26:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-11 15:26:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2020-10-11 15:26:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-11 15:26:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2020-10-11 15:26:37,166 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 18 [2020-10-11 15:26:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:37,166 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2020-10-11 15:26:37,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2020-10-11 15:26:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:37,167 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:37,167 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:37,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:26:37,168 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash -318962108, now seen corresponding path program 5 times [2020-10-11 15:26:37,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:37,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302894706] [2020-10-11 15:26:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:37,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302894706] [2020-10-11 15:26:37,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:37,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:37,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447751112] [2020-10-11 15:26:37,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:37,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:37,936 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand 14 states. [2020-10-11 15:26:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:39,045 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-10-11 15:26:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 15:26:39,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:39,047 INFO L225 Difference]: With dead ends: 152 [2020-10-11 15:26:39,047 INFO L226 Difference]: Without dead ends: 144 [2020-10-11 15:26:39,048 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:26:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-11 15:26:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-10-11 15:26:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-11 15:26:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 187 transitions. [2020-10-11 15:26:39,057 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 187 transitions. Word has length 18 [2020-10-11 15:26:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:39,058 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 187 transitions. [2020-10-11 15:26:39,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 187 transitions. [2020-10-11 15:26:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:39,058 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:39,059 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:39,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:26:39,059 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash -569697014, now seen corresponding path program 6 times [2020-10-11 15:26:39,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:39,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456443944] [2020-10-11 15:26:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:39,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456443944] [2020-10-11 15:26:39,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:39,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:39,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773503211] [2020-10-11 15:26:39,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:39,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:39,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:39,918 INFO L87 Difference]: Start difference. First operand 100 states and 187 transitions. Second operand 14 states. [2020-10-11 15:26:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:40,937 INFO L93 Difference]: Finished difference Result 154 states and 283 transitions. [2020-10-11 15:26:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 15:26:40,938 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:40,940 INFO L225 Difference]: With dead ends: 154 [2020-10-11 15:26:40,940 INFO L226 Difference]: Without dead ends: 142 [2020-10-11 15:26:40,941 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:26:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-11 15:26:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2020-10-11 15:26:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-11 15:26:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2020-10-11 15:26:40,946 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 18 [2020-10-11 15:26:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:40,946 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2020-10-11 15:26:40,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2020-10-11 15:26:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:40,947 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:40,947 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:40,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:26:40,948 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -269125948, now seen corresponding path program 7 times [2020-10-11 15:26:40,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:40,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260599144] [2020-10-11 15:26:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:41,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260599144] [2020-10-11 15:26:41,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:41,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:41,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928640983] [2020-10-11 15:26:41,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:41,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:41,797 INFO L87 Difference]: Start difference. First operand 98 states and 183 transitions. Second operand 14 states. [2020-10-11 15:26:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:42,737 INFO L93 Difference]: Finished difference Result 149 states and 278 transitions. [2020-10-11 15:26:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:26:42,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:42,740 INFO L225 Difference]: With dead ends: 149 [2020-10-11 15:26:42,740 INFO L226 Difference]: Without dead ends: 133 [2020-10-11 15:26:42,740 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:26:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-11 15:26:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2020-10-11 15:26:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-11 15:26:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 179 transitions. [2020-10-11 15:26:42,744 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 179 transitions. Word has length 18 [2020-10-11 15:26:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:42,744 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 179 transitions. [2020-10-11 15:26:42,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 179 transitions. [2020-10-11 15:26:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:42,745 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:42,745 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:42,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:26:42,745 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:42,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash -969779638, now seen corresponding path program 8 times [2020-10-11 15:26:42,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:42,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490150635] [2020-10-11 15:26:42,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:43,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490150635] [2020-10-11 15:26:43,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:43,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 15:26:43,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522597763] [2020-10-11 15:26:43,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 15:26:43,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:43,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 15:26:43,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-11 15:26:43,451 INFO L87 Difference]: Start difference. First operand 96 states and 179 transitions. Second operand 14 states. [2020-10-11 15:26:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:44,455 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2020-10-11 15:26:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 15:26:44,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-11 15:26:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:44,457 INFO L225 Difference]: With dead ends: 167 [2020-10-11 15:26:44,458 INFO L226 Difference]: Without dead ends: 147 [2020-10-11 15:26:44,458 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-11 15:26:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-11 15:26:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 94. [2020-10-11 15:26:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-11 15:26:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-11 15:26:44,462 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-11 15:26:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:44,462 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-11 15:26:44,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 15:26:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-11 15:26:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:44,463 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:44,463 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:44,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 15:26:44,464 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:44,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440908, now seen corresponding path program 3 times [2020-10-11 15:26:44,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:44,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575047475] [2020-10-11 15:26:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:26:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:26:44,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575047475] [2020-10-11 15:26:44,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:26:44,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:26:44,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013141631] [2020-10-11 15:26:44,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:26:44,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:26:44,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:26:44,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:26:44,864 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 11 states. [2020-10-11 15:26:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:26:45,406 INFO L93 Difference]: Finished difference Result 206 states and 364 transitions. [2020-10-11 15:26:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 15:26:45,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-11 15:26:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:26:45,408 INFO L225 Difference]: With dead ends: 206 [2020-10-11 15:26:45,408 INFO L226 Difference]: Without dead ends: 206 [2020-10-11 15:26:45,409 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:26:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-11 15:26:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 116. [2020-10-11 15:26:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-11 15:26:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 229 transitions. [2020-10-11 15:26:45,413 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 229 transitions. Word has length 18 [2020-10-11 15:26:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:26:45,414 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 229 transitions. [2020-10-11 15:26:45,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:26:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2020-10-11 15:26:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:26:45,415 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:26:45,415 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:26:45,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 15:26:45,415 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:26:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:26:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440926, now seen corresponding path program 9 times [2020-10-11 15:26:45,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:26:45,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303538507] [2020-10-11 15:26:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:26:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:26:45,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:26:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:26:45,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:26:45,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:26:45,514 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:26:45,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 15:26:45,516 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 15:26:45,527 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [392] [392] L1682-->L1739: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out-1112101064 0)) (= |ULTIMATE.start_ldv_assert_#in~expression_In-1112101064| ULTIMATE.start_ldv_assert_~expression_Out-1112101064)) InVars {ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-1112101064|} OutVars{ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out-1112101064|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-1112101064|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1112101064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem40, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-11 15:26:45,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:26:45 BasicIcfg [2020-10-11 15:26:45,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:26:45,621 INFO L168 Benchmark]: Toolchain (without parser) took 56369.10 ms. Allocated memory was 251.7 MB in the beginning and 599.8 MB in the end (delta: 348.1 MB). Free memory was 204.4 MB in the beginning and 293.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 259.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:26:45,621 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:26:45,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1333.69 ms. Allocated memory was 251.7 MB in the beginning and 356.0 MB in the end (delta: 104.3 MB). Free memory was 204.4 MB in the beginning and 325.7 MB in the end (delta: -121.3 MB). Peak memory consumption was 109.4 MB. Max. memory is 14.2 GB. [2020-10-11 15:26:45,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.35 ms. Allocated memory is still 356.0 MB. Free memory was 325.7 MB in the beginning and 322.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-11 15:26:45,623 INFO L168 Benchmark]: Boogie Preprocessor took 64.25 ms. Allocated memory is still 356.0 MB. Free memory was 322.4 MB in the beginning and 319.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. [2020-10-11 15:26:45,625 INFO L168 Benchmark]: RCFGBuilder took 675.95 ms. Allocated memory is still 356.0 MB. Free memory was 319.1 MB in the beginning and 273.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:26:45,626 INFO L168 Benchmark]: TraceAbstraction took 54207.62 ms. Allocated memory was 356.0 MB in the beginning and 599.8 MB in the end (delta: 243.8 MB). Free memory was 273.2 MB in the beginning and 293.0 MB in the end (delta: -19.8 MB). Peak memory consumption was 223.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:26:45,633 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.23 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1333.69 ms. Allocated memory was 251.7 MB in the beginning and 356.0 MB in the end (delta: 104.3 MB). Free memory was 204.4 MB in the beginning and 325.7 MB in the end (delta: -121.3 MB). Peak memory consumption was 109.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 80.35 ms. Allocated memory is still 356.0 MB. Free memory was 325.7 MB in the beginning and 322.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 64.25 ms. Allocated memory is still 356.0 MB. Free memory was 322.4 MB in the beginning and 319.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.2 GB. * RCFGBuilder took 675.95 ms. Allocated memory is still 356.0 MB. Free memory was 319.1 MB in the beginning and 273.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 54207.62 ms. Allocated memory was 356.0 MB in the beginning and 599.8 MB in the end (delta: 243.8 MB). Free memory was 273.2 MB in the beginning and 293.0 MB in the end (delta: -19.8 MB). Peak memory consumption was 223.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1421 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 13 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 28.9s, 41 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 34.6s, 129 PlacesBefore, 34 PlacesAfterwards, 131 TransitionsBefore, 32 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 138 TotalNumberOfCompositions, 4067 MoverChecksTotal - 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; [L1725] 0 return 0; [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={3:24}, t1={5:0}, t2={6:0}] [L1696] 1 struct device *dev = (struct device*)arg; [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1700] 1 data->shared.b VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6:0}] [L1696] 2 struct device *dev = (struct device*)arg; [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6: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; [L1713] 0 return 0; [L1735] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1738] 0 data.shared.a [L1739] 0 data.shared.b [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 53.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 34.6s, HoareTripleCheckerStatistics: 269 SDtfs, 583 SDslu, 947 SDs, 0 SdLazy, 3861 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=2, 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, 15 MinimizatonAttempts, 497 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 90647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...