/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:26:29,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:26:29,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:26:29,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:26:29,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:26:29,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:26:29,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:26:29,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:26:29,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:26:29,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:26:29,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:26:29,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:26:29,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:26:29,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:26:29,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:26:29,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:26:29,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:26:29,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:26:29,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:26:29,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:26:29,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:26:29,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:26:29,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:26:29,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:26:29,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:26:29,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:26:29,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:26:29,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:26:29,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:26:29,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:26:29,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:26:29,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:26:29,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:26:29,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:26:29,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:26:29,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:26:29,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:26:29,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:26:29,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:26:29,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:26:29,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:26:29,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:26:29,138 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:26:29,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:26:29,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:26:29,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:26:29,144 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:26:29,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:26:29,144 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:26:29,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:26:29,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:26:29,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:26:29,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:26:29,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:26:29,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:26:29,149 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:26:29,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:26:29,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:26:29,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:26:29,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:26:29,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:26:29,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:26:29,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:26:29,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:26:29,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:26:29,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:26:29,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:26:29,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:26:29,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:26:29,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:26:29,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:26:29,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:26:29,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:26:29,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:26:29,527 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:26:29,528 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:26:29,528 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-16 05:26:29,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a02013c4/c0e086ed620347e49c10cddc38d8da28/FLAG482396682 [2020-10-16 05:26:30,185 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:26:30,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-16 05:26:30,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a02013c4/c0e086ed620347e49c10cddc38d8da28/FLAG482396682 [2020-10-16 05:26:30,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a02013c4/c0e086ed620347e49c10cddc38d8da28 [2020-10-16 05:26:30,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:26:30,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:26:30,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:26:30,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:26:30,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:26:30,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:26:30" (1/1) ... [2020-10-16 05:26:30,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:30, skipping insertion in model container [2020-10-16 05:26:30,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:26:30" (1/1) ... [2020-10-16 05:26:30,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:26:30,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:26:31,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:26:31,275 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:26:31,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:26:31,696 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:26:31,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31 WrapperNode [2020-10-16 05:26:31,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:26:31,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:26:31,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:26:31,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:26:31,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:26:31,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:26:31,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:26:31,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:26:31,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (1/1) ... [2020-10-16 05:26:31,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:26:31,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:26:31,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:26:31,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:26:31,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (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-16 05:26:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:26:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 05:26:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-16 05:26:31,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:26:31,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:26:31,898 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-16 05:26:31,898 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-16 05:26:31,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:26:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:26:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 05:26:31,901 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:26:32,498 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:26:32,498 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-16 05:26:32,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:26:32 BoogieIcfgContainer [2020-10-16 05:26:32,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:26:32,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:26:32,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:26:32,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:26:32,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:26:30" (1/3) ... [2020-10-16 05:26:32,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70afbae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:26:32, skipping insertion in model container [2020-10-16 05:26:32,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:26:31" (2/3) ... [2020-10-16 05:26:32,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70afbae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:26:32, skipping insertion in model container [2020-10-16 05:26:32,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:26:32" (3/3) ... [2020-10-16 05:26:32,509 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-16 05:26:32,522 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:26:32,530 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-16 05:26:32,531 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:26:32,563 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,564 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,564 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,564 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,564 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,564 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,565 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,566 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,567 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,567 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,567 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,568 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,568 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,568 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,569 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,569 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,569 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,570 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,571 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,572 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,572 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,573 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,577 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,577 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,578 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,578 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,588 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,588 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,589 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,590 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,590 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,590 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:26:32,616 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-16 05:26:32,635 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:26:32,636 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:26:32,636 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:26:32,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:26:32,636 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:26:32,636 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:26:32,636 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:26:32,636 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:26:32,654 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-16 05:26:32,721 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-16 05:26:32,721 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:26:32,727 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-10-16 05:26:32,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 148 transitions, 318 flow [2020-10-16 05:26:32,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 137 transitions, 292 flow [2020-10-16 05:26:32,738 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:26:32,741 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 137 transitions, 292 flow [2020-10-16 05:26:32,744 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 137 transitions, 292 flow [2020-10-16 05:26:32,744 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 135 places, 137 transitions, 292 flow [2020-10-16 05:26:32,778 INFO L129 PetriNetUnfolder]: 8/169 cut-off events. [2020-10-16 05:26:32,779 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:26:32,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 8/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 288 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2020-10-16 05:26:32,783 INFO L117 LiptonReduction]: Number of co-enabled transitions 1660 [2020-10-16 05:26:33,070 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-16 05:26:33,102 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:33,110 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-16 05:26:33,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:33,132 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-16 05:26:33,133 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:26:33,149 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-16 05:26:33,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:33,181 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-16 05:26:33,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:33,203 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-16 05:26:33,203 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:26:35,693 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-16 05:26:35,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:35,740 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:26:35,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:35,762 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-16 05:26:35,763 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:26:35,787 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-16 05:26:35,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:35,820 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-16 05:26:35,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:35,848 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-16 05:26:35,849 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:26:37,958 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-16 05:26:37,983 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:37,987 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-16 05:26:38,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:38,008 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-16 05:26:38,009 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:26:38,027 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-16 05:26:38,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:38,057 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-16 05:26:38,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:38,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-16 05:26:38,080 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:26:40,178 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-16 05:26:40,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:40,201 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-16 05:26:40,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:40,215 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-16 05:26:40,216 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-16 05:26:40,241 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-16 05:26:40,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:40,274 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-16 05:26:40,294 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:40,296 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-16 05:26:40,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:26:40,307 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-16 05:26:40,332 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:40,336 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-16 05:26:40,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:40,355 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-16 05:26:40,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:26:43,038 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-16 05:26:43,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:43,076 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-16 05:26:43,098 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:43,099 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-16 05:26:43,100 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:26:43,119 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-16 05:26:43,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:43,154 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:26:43,178 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:43,180 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-16 05:26:43,180 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:26:45,509 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-16 05:26:45,533 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:45,537 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-16 05:26:45,561 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:45,562 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-16 05:26:45,563 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 05:26:45,576 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-16 05:26:45,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:45,609 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-16 05:26:45,651 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:45,652 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-16 05:26:45,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 05:26:45,885 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-16 05:26:45,970 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-16 05:26:46,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:46,009 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-16 05:26:46,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:46,043 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-16 05:26:46,043 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:26:46,059 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-16 05:26:46,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:46,098 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-16 05:26:46,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:46,125 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-16 05:26:46,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-16 05:26:48,207 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-16 05:26:48,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:48,231 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-16 05:26:48,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:48,246 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-16 05:26:48,247 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-16 05:26:48,494 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-16 05:26:48,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:48,538 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-16 05:26:48,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:48,578 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-16 05:26:48,578 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-16 05:26:48,596 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-16 05:26:48,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:48,660 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-16 05:26:48,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:48,698 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-16 05:26:48,699 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-16 05:26:50,867 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-16 05:26:50,895 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:50,901 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-16 05:26:50,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:50,923 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-16 05:26:50,924 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:26:50,937 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-16 05:26:50,961 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:50,966 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-16 05:26:50,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:50,995 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:26:50,996 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:26:53,027 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-16 05:26:53,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:53,065 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-16 05:26:53,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:53,092 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-16 05:26:53,093 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-16 05:26:53,105 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-16 05:26:53,137 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:53,141 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-16 05:26:53,179 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:53,181 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-16 05:26:53,181 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:26:55,208 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-16 05:26:55,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:55,247 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-16 05:26:55,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:55,272 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-16 05:26:55,272 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-16 05:26:55,290 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-16 05:26:55,329 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:55,334 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-16 05:26:55,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:55,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-16 05:26:55,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:26:57,579 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:26:57,607 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:57,611 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-16 05:26:57,637 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:57,638 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-16 05:26:57,639 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:26:57,655 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-16 05:26:57,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:57,687 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-16 05:26:57,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:26:57,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-16 05:26:57,713 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:27:00,677 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-16 05:27:00,787 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-16 05:27:00,921 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-10-16 05:27:01,417 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2020-10-16 05:27:01,994 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 115 [2020-10-16 05:27:02,191 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 05:27:02,304 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2020-10-16 05:27:02,840 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-16 05:27:03,090 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 05:27:04,125 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2020-10-16 05:27:04,148 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-16 05:27:04,572 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:27:04,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:27:04,581 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-16 05:27:05,012 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 05:27:05,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:27:05,014 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-16 05:27:05,014 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-16 05:27:05,432 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 05:27:05,452 INFO L132 LiptonReduction]: Checked pairs total: 3830 [2020-10-16 05:27:05,452 INFO L134 LiptonReduction]: Total number of compositions: 150 [2020-10-16 05:27:05,455 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32719 [2020-10-16 05:27:05,461 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2020-10-16 05:27:05,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:27:05,461 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:05,462 INFO L255 CegarLoopForPetriNet]: trace histogram [1] [2020-10-16 05:27:05,462 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 524, now seen corresponding path program 1 times [2020-10-16 05:27:05,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:05,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033121897] [2020-10-16 05:27:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:27:05,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033121897] [2020-10-16 05:27:05,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:05,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-16 05:27:05,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224610085] [2020-10-16 05:27:05,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 05:27:05,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 05:27:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 05:27:05,771 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 298 [2020-10-16 05:27:05,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand 2 states. [2020-10-16 05:27:05,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:05,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 298 [2020-10-16 05:27:05,776 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:05,789 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2020-10-16 05:27:05,790 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:27:05,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 36 events. 2/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 44. Up to 3 conditions per place. [2020-10-16 05:27:05,791 INFO L132 encePairwiseOnDemand]: 296/298 looper letters, 0 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2020-10-16 05:27:05,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 74 flow [2020-10-16 05:27:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 05:27:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-16 05:27:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 542 transitions. [2020-10-16 05:27:05,810 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9093959731543624 [2020-10-16 05:27:05,810 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 542 transitions. [2020-10-16 05:27:05,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 542 transitions. [2020-10-16 05:27:05,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:05,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 542 transitions. [2020-10-16 05:27:05,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-16 05:27:05,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-16 05:27:05,834 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-16 05:27:05,836 INFO L185 Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 2 states and 542 transitions. [2020-10-16 05:27:05,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 74 flow [2020-10-16 05:27:05,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 62 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 05:27:05,842 INFO L241 Difference]: Finished difference. Result has 28 places, 28 transitions, 62 flow [2020-10-16 05:27:05,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2020-10-16 05:27:05,846 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -5 predicate places. [2020-10-16 05:27:05,847 INFO L481 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 62 flow [2020-10-16 05:27:05,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 05:27:05,847 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:05,847 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2020-10-16 05:27:05,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:27:05,848 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 16112991, now seen corresponding path program 1 times [2020-10-16 05:27:05,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:05,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864568789] [2020-10-16 05:27:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:06,035 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-16 05:27:06,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864568789] [2020-10-16 05:27:06,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:06,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:27:06,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147818547] [2020-10-16 05:27:06,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:27:06,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:27:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:27:06,043 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 298 [2020-10-16 05:27:06,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 62 flow. Second operand 3 states. [2020-10-16 05:27:06,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:06,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 298 [2020-10-16 05:27:06,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:06,280 INFO L129 PetriNetUnfolder]: 241/451 cut-off events. [2020-10-16 05:27:06,281 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:27:06,282 INFO L80 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 451 events. 241/451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2034 event pairs, 97 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 893. Up to 340 conditions per place. [2020-10-16 05:27:06,286 INFO L132 encePairwiseOnDemand]: 291/298 looper letters, 24 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2020-10-16 05:27:06,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 37 transitions, 140 flow [2020-10-16 05:27:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:27:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:27:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2020-10-16 05:27:06,290 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6085011185682326 [2020-10-16 05:27:06,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2020-10-16 05:27:06,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2020-10-16 05:27:06,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:06,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2020-10-16 05:27:06,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:27:06,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:27:06,296 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:27:06,296 INFO L185 Difference]: Start difference. First operand has 28 places, 28 transitions, 62 flow. Second operand 3 states and 544 transitions. [2020-10-16 05:27:06,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 37 transitions, 140 flow [2020-10-16 05:27:06,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:27:06,299 INFO L241 Difference]: Finished difference. Result has 31 places, 32 transitions, 98 flow [2020-10-16 05:27:06,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2020-10-16 05:27:06,300 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 05:27:06,300 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 98 flow [2020-10-16 05:27:06,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:27:06,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:06,300 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 05:27:06,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:27:06,301 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:06,301 INFO L82 PathProgramCache]: Analyzing trace with hash 499501981, now seen corresponding path program 1 times [2020-10-16 05:27:06,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:06,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159920380] [2020-10-16 05:27:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:06,371 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-16 05:27:06,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159920380] [2020-10-16 05:27:06,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:06,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:27:06,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027719704] [2020-10-16 05:27:06,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:27:06,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:27:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:27:06,375 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 298 [2020-10-16 05:27:06,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 98 flow. Second operand 3 states. [2020-10-16 05:27:06,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:06,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 298 [2020-10-16 05:27:06,376 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:06,521 INFO L129 PetriNetUnfolder]: 268/507 cut-off events. [2020-10-16 05:27:06,521 INFO L130 PetriNetUnfolder]: For 152/162 co-relation queries the response was YES. [2020-10-16 05:27:06,523 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 507 events. 268/507 cut-off events. For 152/162 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2415 event pairs, 111 based on Foata normal form. 32/527 useless extension candidates. Maximal degree in co-relation 1303. Up to 376 conditions per place. [2020-10-16 05:27:06,527 INFO L132 encePairwiseOnDemand]: 291/298 looper letters, 26 selfloop transitions, 9 changer transitions 2/44 dead transitions. [2020-10-16 05:27:06,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 218 flow [2020-10-16 05:27:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:27:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:27:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2020-10-16 05:27:06,530 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6073825503355704 [2020-10-16 05:27:06,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 543 transitions. [2020-10-16 05:27:06,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 543 transitions. [2020-10-16 05:27:06,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:06,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 543 transitions. [2020-10-16 05:27:06,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:27:06,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:27:06,535 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:27:06,535 INFO L185 Difference]: Start difference. First operand has 31 places, 32 transitions, 98 flow. Second operand 3 states and 543 transitions. [2020-10-16 05:27:06,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 218 flow [2020-10-16 05:27:06,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:27:06,539 INFO L241 Difference]: Finished difference. Result has 33 places, 38 transitions, 163 flow [2020-10-16 05:27:06,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=33, PETRI_TRANSITIONS=38} [2020-10-16 05:27:06,540 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2020-10-16 05:27:06,540 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 38 transitions, 163 flow [2020-10-16 05:27:06,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:27:06,540 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:06,540 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:27:06,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:27:06,541 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash -107206842, now seen corresponding path program 1 times [2020-10-16 05:27:06,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:06,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116912077] [2020-10-16 05:27:06,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:27:06,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116912077] [2020-10-16 05:27:06,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:06,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:27:06,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633687760] [2020-10-16 05:27:06,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:27:06,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:27:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:27:06,602 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 298 [2020-10-16 05:27:06,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 38 transitions, 163 flow. Second operand 3 states. [2020-10-16 05:27:06,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:06,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 298 [2020-10-16 05:27:06,603 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:06,622 INFO L129 PetriNetUnfolder]: 5/39 cut-off events. [2020-10-16 05:27:06,622 INFO L130 PetriNetUnfolder]: For 13/26 co-relation queries the response was YES. [2020-10-16 05:27:06,622 INFO L80 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 39 events. 5/39 cut-off events. For 13/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 4 based on Foata normal form. 11/47 useless extension candidates. Maximal degree in co-relation 68. Up to 13 conditions per place. [2020-10-16 05:27:06,623 INFO L132 encePairwiseOnDemand]: 296/298 looper letters, 2 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2020-10-16 05:27:06,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 70 flow [2020-10-16 05:27:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:27:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:27:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2020-10-16 05:27:06,626 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8165548098434005 [2020-10-16 05:27:06,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 730 transitions. [2020-10-16 05:27:06,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 730 transitions. [2020-10-16 05:27:06,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:06,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 730 transitions. [2020-10-16 05:27:06,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:27:06,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:27:06,631 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:27:06,631 INFO L185 Difference]: Start difference. First operand has 33 places, 38 transitions, 163 flow. Second operand 3 states and 730 transitions. [2020-10-16 05:27:06,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 70 flow [2020-10-16 05:27:06,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 62 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 05:27:06,633 INFO L241 Difference]: Finished difference. Result has 27 places, 21 transitions, 58 flow [2020-10-16 05:27:06,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2020-10-16 05:27:06,634 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -6 predicate places. [2020-10-16 05:27:06,634 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 58 flow [2020-10-16 05:27:06,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:27:06,634 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:06,634 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:27:06,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:27:06,635 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 948502865, now seen corresponding path program 1 times [2020-10-16 05:27:06,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:06,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480648664] [2020-10-16 05:27:06,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:06,924 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-16 05:27:06,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480648664] [2020-10-16 05:27:06,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:06,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:27:06,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710016862] [2020-10-16 05:27:06,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:27:06,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:27:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:27:06,929 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 298 [2020-10-16 05:27:06,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 58 flow. Second operand 7 states. [2020-10-16 05:27:06,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:06,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 298 [2020-10-16 05:27:06,931 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:07,245 INFO L129 PetriNetUnfolder]: 78/197 cut-off events. [2020-10-16 05:27:07,245 INFO L130 PetriNetUnfolder]: For 42/44 co-relation queries the response was YES. [2020-10-16 05:27:07,246 INFO L80 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 197 events. 78/197 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 792 event pairs, 4 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 441. Up to 67 conditions per place. [2020-10-16 05:27:07,247 INFO L132 encePairwiseOnDemand]: 290/298 looper letters, 30 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2020-10-16 05:27:07,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 242 flow [2020-10-16 05:27:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:27:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:27:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1076 transitions. [2020-10-16 05:27:07,253 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5158197507190796 [2020-10-16 05:27:07,253 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1076 transitions. [2020-10-16 05:27:07,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1076 transitions. [2020-10-16 05:27:07,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:07,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1076 transitions. [2020-10-16 05:27:07,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:27:07,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:27:07,261 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:27:07,261 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 58 flow. Second operand 7 states and 1076 transitions. [2020-10-16 05:27:07,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 242 flow [2020-10-16 05:27:07,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:27:07,265 INFO L241 Difference]: Finished difference. Result has 36 places, 34 transitions, 178 flow [2020-10-16 05:27:07,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2020-10-16 05:27:07,265 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 05:27:07,265 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 178 flow [2020-10-16 05:27:07,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:27:07,266 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:07,266 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:27:07,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:27:07,266 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1843892213, now seen corresponding path program 1 times [2020-10-16 05:27:07,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:07,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146171809] [2020-10-16 05:27:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:07,750 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-16 05:27:07,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146171809] [2020-10-16 05:27:07,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:07,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:27:07,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769129766] [2020-10-16 05:27:07,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:27:07,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:27:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:27:07,759 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 298 [2020-10-16 05:27:07,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 178 flow. Second operand 12 states. [2020-10-16 05:27:07,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:07,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 298 [2020-10-16 05:27:07,762 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:08,667 INFO L129 PetriNetUnfolder]: 97/270 cut-off events. [2020-10-16 05:27:08,667 INFO L130 PetriNetUnfolder]: For 348/352 co-relation queries the response was YES. [2020-10-16 05:27:08,668 INFO L80 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 270 events. 97/270 cut-off events. For 348/352 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1329 event pairs, 12 based on Foata normal form. 5/271 useless extension candidates. Maximal degree in co-relation 802. Up to 108 conditions per place. [2020-10-16 05:27:08,670 INFO L132 encePairwiseOnDemand]: 286/298 looper letters, 49 selfloop transitions, 30 changer transitions 10/94 dead transitions. [2020-10-16 05:27:08,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 663 flow [2020-10-16 05:27:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:27:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:27:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1591 transitions. [2020-10-16 05:27:08,678 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4853569249542404 [2020-10-16 05:27:08,678 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1591 transitions. [2020-10-16 05:27:08,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1591 transitions. [2020-10-16 05:27:08,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:08,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1591 transitions. [2020-10-16 05:27:08,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:27:08,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:27:08,689 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:27:08,689 INFO L185 Difference]: Start difference. First operand has 36 places, 34 transitions, 178 flow. Second operand 11 states and 1591 transitions. [2020-10-16 05:27:08,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 663 flow [2020-10-16 05:27:08,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 94 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:27:08,695 INFO L241 Difference]: Finished difference. Result has 53 places, 61 transitions, 506 flow [2020-10-16 05:27:08,696 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=506, PETRI_PLACES=53, PETRI_TRANSITIONS=61} [2020-10-16 05:27:08,696 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2020-10-16 05:27:08,696 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 506 flow [2020-10-16 05:27:08,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:27:08,696 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:08,697 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:27:08,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:27:08,697 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1582760463, now seen corresponding path program 2 times [2020-10-16 05:27:08,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:08,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075106694] [2020-10-16 05:27:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:27:09,099 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-16 05:27:09,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075106694] [2020-10-16 05:27:09,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:27:09,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:27:09,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831682627] [2020-10-16 05:27:09,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:27:09,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:27:09,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:27:09,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:27:09,106 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 298 [2020-10-16 05:27:09,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 506 flow. Second operand 12 states. [2020-10-16 05:27:09,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:27:09,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 298 [2020-10-16 05:27:09,108 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:27:10,009 INFO L129 PetriNetUnfolder]: 121/340 cut-off events. [2020-10-16 05:27:10,010 INFO L130 PetriNetUnfolder]: For 952/954 co-relation queries the response was YES. [2020-10-16 05:27:10,012 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 340 events. 121/340 cut-off events. For 952/954 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1808 event pairs, 20 based on Foata normal form. 3/339 useless extension candidates. Maximal degree in co-relation 1354. Up to 181 conditions per place. [2020-10-16 05:27:10,015 INFO L132 encePairwiseOnDemand]: 288/298 looper letters, 59 selfloop transitions, 34 changer transitions 11/109 dead transitions. [2020-10-16 05:27:10,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 109 transitions, 1054 flow [2020-10-16 05:27:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:27:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:27:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1588 transitions. [2020-10-16 05:27:10,023 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4844417327638804 [2020-10-16 05:27:10,023 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1588 transitions. [2020-10-16 05:27:10,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1588 transitions. [2020-10-16 05:27:10,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:27:10,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1588 transitions. [2020-10-16 05:27:10,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:27:10,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:27:10,036 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:27:10,037 INFO L185 Difference]: Start difference. First operand has 53 places, 61 transitions, 506 flow. Second operand 11 states and 1588 transitions. [2020-10-16 05:27:10,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 109 transitions, 1054 flow [2020-10-16 05:27:10,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 109 transitions, 1016 flow, removed 19 selfloop flow, removed 2 redundant places. [2020-10-16 05:27:10,048 INFO L241 Difference]: Finished difference. Result has 65 places, 79 transitions, 797 flow [2020-10-16 05:27:10,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=797, PETRI_PLACES=65, PETRI_TRANSITIONS=79} [2020-10-16 05:27:10,048 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2020-10-16 05:27:10,048 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 79 transitions, 797 flow [2020-10-16 05:27:10,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:27:10,049 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:27:10,049 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:27:10,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:27:10,049 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:27:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:27:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash -688960063, now seen corresponding path program 3 times [2020-10-16 05:27:10,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:27:10,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111877491] [2020-10-16 05:27:10,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:27:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:27:10,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:27:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:27:10,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:27:10,176 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:27:10,176 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:27:10,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:27:10,177 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:27:10,177 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:27:10,178 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:27:10,182 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [496] [496] ULTIMATE.startENTRY-->L1708-2: Formula: (let ((.cse3 (store |#valid_In-949615226| 0 0))) (let ((.cse4 (store .cse3 |~#t1~0.base_Out-949615226| 1))) (let ((.cse1 (store .cse4 |~#t2~0.base_Out-949615226| 1)) (.cse2 (+ ULTIMATE.start_my_drv_probe_~data.offset_Out-949615226 24)) (.cse0 (+ ULTIMATE.start_my_drv_probe_~data.offset_Out-949615226 28))) (and (= |ULTIMATE.start_main_~#data~1.offset_Out-949615226| 0) (= |#NULL.base_Out-949615226| 0) (= |#pthreadsMutex_Out-949615226| (store |#pthreadsMutex_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226 (store (select |#pthreadsMutex_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) ULTIMATE.start_my_drv_probe_~data.offset_Out-949615226 0))) (= ULTIMATE.start_ldv_assert_~expression_Out-949615226 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset_Out-949615226| ULTIMATE.start_my_drv_probe_~data.offset_Out-949615226) (= (select (select |#memory_int_Out-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) .cse0) |ULTIMATE.start_my_drv_probe_#t~mem32_Out-949615226|) (= |~#t2~0.offset_Out-949615226| 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset_Out-949615226| |ULTIMATE.start_main_~#data~1.offset_Out-949615226|) (= |~#t1~0.offset_Out-949615226| 0) (= |#NULL.offset_Out-949615226| 0) (= (select .cse1 |ULTIMATE.start_main_~#data~1.base_Out-949615226|) 0) (= |#valid_Out-949615226| (store .cse1 |ULTIMATE.start_main_~#data~1.base_Out-949615226| 1)) (= |#length_Out-949615226| (store (store (store |#length_In-949615226| |~#t1~0.base_Out-949615226| 4) |~#t2~0.base_Out-949615226| 4) |ULTIMATE.start_main_~#data~1.base_Out-949615226| 32)) (= (select (select |#memory_int_In-949615226| |~#t1~0.base_Out-949615226|) |~#t1~0.offset_Out-949615226|) 0) (= ULTIMATE.start_my_drv_probe_~data.base_Out-949615226 |ULTIMATE.start_my_drv_probe_#in~data.base_Out-949615226|) (= (store |#memory_int_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226 (store (store (select |#memory_int_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) .cse2 0) .cse0 0)) |#memory_int_Out-949615226|) (= ULTIMATE.start_main_~ret~0_Out-949615226 0) (= (select .cse3 |~#t1~0.base_Out-949615226|) 0) (= 0 |ULTIMATE.start_my_drv_init_#res_Out-949615226|) (= |ULTIMATE.start_ldv_assert_#in~expression_Out-949615226| 1) (= ~my_dev~0.base_Out-949615226 0) (= |ULTIMATE.start_main_~#data~1.base_Out-949615226| |ULTIMATE.start_my_drv_probe_#in~data.base_Out-949615226|) (= ~my_dev~0.offset_Out-949615226 0) (< |#StackHeapBarrier_In-949615226| |~#t1~0.base_Out-949615226|) (= |#memory_$Pointer$.base_Out-949615226| (store |#memory_$Pointer$.base_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226 (store (store (select |#memory_$Pointer$.base_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) .cse2 v_DerPreprocessor_73) .cse0 (select (select |#memory_$Pointer$.base_Out-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) .cse0)))) (= |#memory_$Pointer$.offset_Out-949615226| (store |#memory_$Pointer$.offset_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226 (store (store (select |#memory_$Pointer$.offset_In-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) .cse2 v_DerPreprocessor_74) .cse0 (select (select |#memory_$Pointer$.offset_Out-949615226| ULTIMATE.start_my_drv_probe_~data.base_Out-949615226) .cse0)))) (< 0 |#StackHeapBarrier_In-949615226|) (< |#StackHeapBarrier_In-949615226| |~#t2~0.base_Out-949615226|) (< |#StackHeapBarrier_In-949615226| |ULTIMATE.start_main_~#data~1.base_Out-949615226|) (= (select .cse4 |~#t2~0.base_Out-949615226|) 0) (= (select (select |#memory_int_In-949615226| |~#t2~0.base_Out-949615226|) |~#t2~0.offset_Out-949615226|) 0))))) InVars {#pthreadsMutex=|#pthreadsMutex_In-949615226|, #StackHeapBarrier=|#StackHeapBarrier_In-949615226|, #memory_$Pointer$.base=|#memory_$Pointer$.base_In-949615226|, #valid=|#valid_In-949615226|, #memory_int=|#memory_int_In-949615226|, #length=|#length_In-949615226|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_In-949615226|} OutVars{ULTIMATE.start_main_#t~mem45=|ULTIMATE.start_main_#t~mem45_Out-949615226|, ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out-949615226|, ULTIMATE.start_main_#t~mem44=|ULTIMATE.start_main_#t~mem44_Out-949615226|, #memory_$Pointer$.base=|#memory_$Pointer$.base_Out-949615226|, ULTIMATE.start_my_drv_probe_#res=|ULTIMATE.start_my_drv_probe_#res_Out-949615226|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out-949615226|, #NULL.offset=|#NULL.offset_Out-949615226|, ~#t1~0.offset=|~#t1~0.offset_Out-949615226|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-949615226, ~#t1~0.base=|~#t1~0.base_Out-949615226|, ULTIMATE.start_my_drv_probe_~data.base=ULTIMATE.start_my_drv_probe_~data.base_Out-949615226, ULTIMATE.start_my_drv_init_#res=|ULTIMATE.start_my_drv_init_#res_Out-949615226|, ~#t2~0.offset=|~#t2~0.offset_Out-949615226|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_Out-949615226|, #length=|#length_Out-949615226|, ~my_dev~0.offset=~my_dev~0.offset_Out-949615226, ~#t2~0.base=|~#t2~0.base_Out-949615226|, #pthreadsMutex=|#pthreadsMutex_Out-949615226|, ULTIMATE.start_my_drv_probe_#in~data.base=|ULTIMATE.start_my_drv_probe_#in~data.base_Out-949615226|, ULTIMATE.start_main_~ret~0=ULTIMATE.start_main_~ret~0_Out-949615226, ULTIMATE.start_main_#t~ret40=|ULTIMATE.start_main_#t~ret40_Out-949615226|, ULTIMATE.start_my_drv_probe_~data.offset=ULTIMATE.start_my_drv_probe_~data.offset_Out-949615226, ULTIMATE.start_main_#t~ret41=|ULTIMATE.start_main_#t~ret41_Out-949615226|, ULTIMATE.start_my_drv_probe_#in~data.offset=|ULTIMATE.start_my_drv_probe_#in~data.offset_Out-949615226|, ~my_dev~0.base=~my_dev~0.base_Out-949615226, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_Out-949615226|, ULTIMATE.start_my_drv_probe_#t~nondet35=|ULTIMATE.start_my_drv_probe_#t~nondet35_Out-949615226|, ULTIMATE.start_my_drv_probe_~res~0=ULTIMATE.start_my_drv_probe_~res~0_Out-949615226, ULTIMATE.start_my_drv_probe_#t~nondet34=|ULTIMATE.start_my_drv_probe_#t~nondet34_Out-949615226|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out-949615226|, #NULL.base=|#NULL.base_Out-949615226|, #StackHeapBarrier=|#StackHeapBarrier_In-949615226|, ULTIMATE.start_my_drv_probe_#t~mem31=|ULTIMATE.start_my_drv_probe_#t~mem31_Out-949615226|, ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out-949615226|, ULTIMATE.start_main_#res=|ULTIMATE.start_main_#res_Out-949615226|, #valid=|#valid_Out-949615226|, #memory_int=|#memory_int_Out-949615226|, ULTIMATE.start_main_~probe_ret~0=ULTIMATE.start_main_~probe_ret~0_Out-949615226, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_Out-949615226|, #memory_$Pointer$.offset=|#memory_$Pointer$.offset_Out-949615226|} AuxVars[v_DerPreprocessor_73, v_DerPreprocessor_74] AssignedVars[ULTIMATE.start_main_#t~mem45, ULTIMATE.start_main_#t~mem43, ULTIMATE.start_main_#t~mem44, #memory_$Pointer$.base, ULTIMATE.start_my_drv_probe_#res, ULTIMATE.start_main_#t~mem42, #NULL.offset, ~#t1~0.offset, ULTIMATE.start_ldv_assert_~expression, ~#t1~0.base, ULTIMATE.start_my_drv_probe_~data.base, ULTIMATE.start_my_drv_init_#res, ~#t2~0.offset, ULTIMATE.start_main_~#data~1.offset, #length, ~my_dev~0.offset, ~#t2~0.base, #pthreadsMutex, ULTIMATE.start_my_drv_probe_#in~data.base, ULTIMATE.start_main_~ret~0, ULTIMATE.start_main_#t~ret40, ULTIMATE.start_my_drv_probe_~data.offset, ULTIMATE.start_main_#t~ret41, ULTIMATE.start_my_drv_probe_#in~data.offset, ~my_dev~0.base, ULTIMATE.start_my_drv_probe_#t~nondet33, ULTIMATE.start_my_drv_probe_#t~nondet35, ULTIMATE.start_my_drv_probe_~res~0, ULTIMATE.start_my_drv_probe_#t~nondet34, ULTIMATE.start_ldv_assert_#in~expression, #NULL.base, ULTIMATE.start_my_drv_probe_#t~mem31, ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~probe_ret~0, ULTIMATE.start_main_~#data~1.base, #memory_$Pointer$.offset] because there is no mapped edge [2020-10-16 05:27:10,183 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [468] [468] L1708-2-->L1709-1: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out983992745 |ULTIMATE.start_ldv_assert_#in~expression_In983992745|) (not (= ULTIMATE.start_ldv_assert_~expression_Out983992745 0)) (<= |ULTIMATE.start_my_drv_probe_#t~nondet33_In983992745| 2147483647) (<= 0 (+ |ULTIMATE.start_my_drv_probe_#t~nondet33_In983992745| 2147483648))) InVars {ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In983992745|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In983992745|} OutVars{ULTIMATE.start_my_drv_probe_#t~mem32=|ULTIMATE.start_my_drv_probe_#t~mem32_Out983992745|, ULTIMATE.start_my_drv_probe_#t~nondet33=|ULTIMATE.start_my_drv_probe_#t~nondet33_In983992745|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In983992745|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out983992745} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#t~mem32, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-16 05:27:10,189 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] L1740-1-->L1741-2: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out187665192 |ULTIMATE.start_ldv_assert_#in~expression_In187665192|) (let ((.cse0 (= 2 |ULTIMATE.start_main_#t~mem43_Out187665192|))) (or (and .cse0 (= |ULTIMATE.start_ldv_assert_#in~expression_Out187665192| 1)) (and (= 0 |ULTIMATE.start_ldv_assert_#in~expression_Out187665192|) (not .cse0)))) (not (= ULTIMATE.start_ldv_assert_~expression_Out187665192 0)) (= (select (select |#memory_int_In187665192| |ULTIMATE.start_main_~#data~1.base_In187665192|) (+ |ULTIMATE.start_main_~#data~1.offset_In187665192| 28)) |ULTIMATE.start_main_#t~mem43_Out187665192|)) InVars {#memory_int=|#memory_int_In187665192|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In187665192|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In187665192|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In187665192|} OutVars{ULTIMATE.start_main_#t~mem43=|ULTIMATE.start_main_#t~mem43_Out187665192|, ULTIMATE.start_main_#t~mem42=|ULTIMATE.start_main_#t~mem42_Out187665192|, #memory_int=|#memory_int_In187665192|, ULTIMATE.start_main_~#data~1.offset=|ULTIMATE.start_main_~#data~1.offset_In187665192|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_Out187665192|, ULTIMATE.start_main_~#data~1.base=|ULTIMATE.start_main_~#data~1.base_In187665192|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out187665192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem43, ULTIMATE.start_main_#t~mem42, ULTIMATE.start_ldv_assert_#in~expression, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-16 05:27:10,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:27:10 BasicIcfg [2020-10-16 05:27:10,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:27:10,238 INFO L168 Benchmark]: Toolchain (without parser) took 39852.21 ms. Allocated memory was 246.9 MB in the beginning and 529.5 MB in the end (delta: 282.6 MB). Free memory was 199.8 MB in the beginning and 180.2 MB in the end (delta: 19.6 MB). Peak memory consumption was 302.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:27:10,238 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 246.9 MB. Free memory is still 223.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:27:10,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1309.24 ms. Allocated memory was 246.9 MB in the beginning and 350.7 MB in the end (delta: 103.8 MB). Free memory was 199.8 MB in the beginning and 316.7 MB in the end (delta: -116.9 MB). Peak memory consumption was 109.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:27:10,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.06 ms. Allocated memory is still 350.7 MB. Free memory was 316.7 MB in the beginning and 313.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:27:10,240 INFO L168 Benchmark]: Boogie Preprocessor took 48.72 ms. Allocated memory is still 350.7 MB. Free memory was 313.2 MB in the beginning and 309.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:27:10,241 INFO L168 Benchmark]: RCFGBuilder took 678.20 ms. Allocated memory is still 350.7 MB. Free memory was 309.7 MB in the beginning and 260.9 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:27:10,242 INFO L168 Benchmark]: TraceAbstraction took 37734.35 ms. Allocated memory was 350.7 MB in the beginning and 529.5 MB in the end (delta: 178.8 MB). Free memory was 260.9 MB in the beginning and 180.2 MB in the end (delta: 80.8 MB). Peak memory consumption was 259.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:27:10,245 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.18 ms. Allocated memory is still 246.9 MB. Free memory is still 223.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1309.24 ms. Allocated memory was 246.9 MB in the beginning and 350.7 MB in the end (delta: 103.8 MB). Free memory was 199.8 MB in the beginning and 316.7 MB in the end (delta: -116.9 MB). Peak memory consumption was 109.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.06 ms. Allocated memory is still 350.7 MB. Free memory was 316.7 MB in the beginning and 313.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 48.72 ms. Allocated memory is still 350.7 MB. Free memory was 313.2 MB in the beginning and 309.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 678.20 ms. Allocated memory is still 350.7 MB. Free memory was 309.7 MB in the beginning and 260.9 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 37734.35 ms. Allocated memory was 350.7 MB in the beginning and 529.5 MB in the end (delta: 178.8 MB). Free memory was 260.9 MB in the beginning and 180.2 MB in the end (delta: 80.8 MB). Peak memory consumption was 259.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1047 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 11 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 24.5s, 40 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 32.7s, 135 PlacesBefore, 33 PlacesAfterwards, 137 TransitionsBefore, 30 TransitionsAfterwards, 1660 CoEnabledTransitionPairs, 8 FixpointIterations, 86 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 150 TotalNumberOfCompositions, 3830 MoverChecksTotal - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1700] EXPR 1 data->shared.b VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1700] 2 data->shared.b VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data->shared.b=0, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={5:0}, t2={7:0}] [L1740] 0 data.shared.a [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={5:0}, t2={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 127 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 37.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 32.8s, HoareTripleCheckerStatistics: 62 SDtfs, 68 SDslu, 39 SDs, 0 SdLazy, 982 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 16510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...