/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 19:58:21,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 19:58:21,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 19:58:21,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 19:58:21,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 19:58:21,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 19:58:21,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 19:58:21,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 19:58:21,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 19:58:21,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 19:58:21,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 19:58:21,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 19:58:21,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 19:58:21,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 19:58:21,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 19:58:21,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 19:58:21,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 19:58:21,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 19:58:21,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 19:58:21,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 19:58:21,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 19:58:21,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 19:58:21,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 19:58:21,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 19:58:21,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 19:58:21,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 19:58:21,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 19:58:21,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 19:58:21,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 19:58:21,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 19:58:21,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 19:58:21,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 19:58:21,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 19:58:21,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 19:58:21,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 19:58:21,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 19:58:21,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 19:58:21,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 19:58:21,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 19:58:21,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 19:58:21,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 19:58:21,851 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.epf [2021-03-11 19:58:21,876 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 19:58:21,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 19:58:21,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 19:58:21,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 19:58:21,878 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 19:58:21,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 19:58:21,879 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 19:58:21,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 19:58:21,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 19:58:21,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 19:58:21,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 19:58:21,880 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:58:21,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 19:58:21,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 19:58:22,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 19:58:22,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 19:58:22,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 19:58:22,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 19:58:22,132 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 19:58:22,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i [2021-03-11 19:58:22,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6770cd603/72d03a787ebb410ab26c2df3abaf5efe/FLAGaabc05d4e [2021-03-11 19:58:22,567 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 19:58:22,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i [2021-03-11 19:58:22,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6770cd603/72d03a787ebb410ab26c2df3abaf5efe/FLAGaabc05d4e [2021-03-11 19:58:22,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6770cd603/72d03a787ebb410ab26c2df3abaf5efe [2021-03-11 19:58:22,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 19:58:22,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 19:58:22,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 19:58:22,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 19:58:22,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 19:58:22,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:58:22" (1/1) ... [2021-03-11 19:58:22,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435f5ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:22, skipping insertion in model container [2021-03-11 19:58:22,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:58:22" (1/1) ... [2021-03-11 19:58:22,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 19:58:23,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 19:58:23,099 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i[949,962] [2021-03-11 19:58:23,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:58:23,254 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 19:58:23,261 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i[949,962] [2021-03-11 19:58:23,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:58:23,342 INFO L208 MainTranslator]: Completed translation [2021-03-11 19:58:23,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23 WrapperNode [2021-03-11 19:58:23,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 19:58:23,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 19:58:23,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 19:58:23,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 19:58:23,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 19:58:23,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 19:58:23,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 19:58:23,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 19:58:23,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (1/1) ... [2021-03-11 19:58:23,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 19:58:23,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 19:58:23,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 19:58:23,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 19:58:23,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (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 [2021-03-11 19:58:23,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 19:58:23,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 19:58:23,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 19:58:23,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 19:58:23,512 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 19:58:23,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 19:58:23,512 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 19:58:23,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 19:58:23,513 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 19:58:23,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 19:58:23,513 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 19:58:23,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 19:58:23,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 19:58:23,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 19:58:23,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 19:58:23,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 19:58:23,515 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 19:58:24,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 19:58:24,887 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 19:58:24,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:58:24 BoogieIcfgContainer [2021-03-11 19:58:24,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 19:58:24,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 19:58:24,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 19:58:24,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 19:58:24,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 07:58:22" (1/3) ... [2021-03-11 19:58:24,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e9c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:58:24, skipping insertion in model container [2021-03-11 19:58:24,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:58:23" (2/3) ... [2021-03-11 19:58:24,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e9c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:58:24, skipping insertion in model container [2021-03-11 19:58:24,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:58:24" (3/3) ... [2021-03-11 19:58:24,895 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004_pso.oepc.i [2021-03-11 19:58:24,901 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 19:58:24,903 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 19:58:24,903 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 19:58:24,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,945 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,946 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,946 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,954 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,955 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,957 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,958 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,959 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,960 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,961 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,970 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,972 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,972 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:58:24,979 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 19:58:24,990 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 19:58:25,013 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 19:58:25,013 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 19:58:25,013 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 19:58:25,013 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 19:58:25,013 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 19:58:25,013 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 19:58:25,014 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 19:58:25,014 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 19:58:25,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-11 19:58:25,062 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-11 19:58:25,062 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:25,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 19:58:25,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-11 19:58:25,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-11 19:58:25,078 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 19:58:25,086 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-11 19:58:25,088 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-11 19:58:25,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-11 19:58:25,111 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-11 19:58:25,112 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:25,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 95 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 19:58:25,115 INFO L116 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-11 19:58:28,537 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-11 19:58:28,686 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-11 19:58:28,997 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-11 19:58:29,148 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-11 19:58:29,152 INFO L131 LiptonReduction]: Checked pairs total: 9264 [2021-03-11 19:58:29,152 INFO L133 LiptonReduction]: Total number of compositions: 94 [2021-03-11 19:58:29,153 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4077 [2021-03-11 19:58:29,160 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 19:58:29,160 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:29,160 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:29,160 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 19:58:29,160 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1220262, now seen corresponding path program 1 times [2021-03-11 19:58:29,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:29,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864659316] [2021-03-11 19:58:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:29,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:29,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:29,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864659316] [2021-03-11 19:58:29,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:29,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:58:29,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313619479] [2021-03-11 19:58:29,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:58:29,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:29,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:58:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:58:29,298 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2021-03-11 19:58:29,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:29,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2021-03-11 19:58:29,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:29,398 INFO L129 PetriNetUnfolder]: 133/305 cut-off events. [2021-03-11 19:58:29,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:29,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 305 events. 133/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1571 event pairs, 110 based on Foata normal form. 33/319 useless extension candidates. Maximal degree in co-relation 513. Up to 153 conditions per place. [2021-03-11 19:58:29,401 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 11 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2021-03-11 19:58:29,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 110 flow [2021-03-11 19:58:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:58:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:58:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-03-11 19:58:29,413 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8945736434108527 [2021-03-11 19:58:29,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-03-11 19:58:29,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-03-11 19:58:29,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:29,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-03-11 19:58:29,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,429 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 577 transitions. [2021-03-11 19:58:29,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 110 flow [2021-03-11 19:58:29,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:29,432 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2021-03-11 19:58:29,433 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-11 19:58:29,433 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-11 19:58:29,433 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-11 19:58:29,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,434 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:29,434 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:29,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 19:58:29,434 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2108913892, now seen corresponding path program 1 times [2021-03-11 19:58:29,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:29,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595731140] [2021-03-11 19:58:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:29,544 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:58:29,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:58:29,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:29,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:29,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595731140] [2021-03-11 19:58:29,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:29,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:58:29,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606148522] [2021-03-11 19:58:29,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:58:29,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:58:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:58:29,562 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 215 [2021-03-11 19:58:29,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:29,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 215 [2021-03-11 19:58:29,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:29,713 INFO L129 PetriNetUnfolder]: 422/830 cut-off events. [2021-03-11 19:58:29,713 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:58:29,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 830 events. 422/830 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5005 event pairs, 241 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 1469. Up to 430 conditions per place. [2021-03-11 19:58:29,719 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 8 selfloop transitions, 5 changer transitions 14/48 dead transitions. [2021-03-11 19:58:29,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 162 flow [2021-03-11 19:58:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 884 transitions. [2021-03-11 19:58:29,722 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8223255813953488 [2021-03-11 19:58:29,722 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 884 transitions. [2021-03-11 19:58:29,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 884 transitions. [2021-03-11 19:58:29,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:29,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 884 transitions. [2021-03-11 19:58:29,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,726 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,726 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 884 transitions. [2021-03-11 19:58:29,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 162 flow [2021-03-11 19:58:29,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:29,727 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2021-03-11 19:58:29,728 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-11 19:58:29,728 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2021-03-11 19:58:29,728 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2021-03-11 19:58:29,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,728 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:29,729 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:29,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 19:58:29,729 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash 557648679, now seen corresponding path program 1 times [2021-03-11 19:58:29,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:29,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229840757] [2021-03-11 19:58:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:29,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:29,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:29,805 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:58:29,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:58:29,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:29,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:29,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229840757] [2021-03-11 19:58:29,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:29,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:58:29,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840923304] [2021-03-11 19:58:29,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:29,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:29,827 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 215 [2021-03-11 19:58:29,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:29,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 215 [2021-03-11 19:58:29,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:29,897 INFO L129 PetriNetUnfolder]: 204/422 cut-off events. [2021-03-11 19:58:29,897 INFO L130 PetriNetUnfolder]: For 381/468 co-relation queries the response was YES. [2021-03-11 19:58:29,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 422 events. 204/422 cut-off events. For 381/468 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2186 event pairs, 56 based on Foata normal form. 34/447 useless extension candidates. Maximal degree in co-relation 1177. Up to 217 conditions per place. [2021-03-11 19:58:29,900 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 14 selfloop transitions, 3 changer transitions 11/49 dead transitions. [2021-03-11 19:58:29,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 241 flow [2021-03-11 19:58:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 881 transitions. [2021-03-11 19:58:29,902 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8195348837209302 [2021-03-11 19:58:29,903 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 881 transitions. [2021-03-11 19:58:29,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 881 transitions. [2021-03-11 19:58:29,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:29,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 881 transitions. [2021-03-11 19:58:29,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.2) internal successors, (881), 5 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,907 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,907 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 5 states and 881 transitions. [2021-03-11 19:58:29,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 241 flow [2021-03-11 19:58:29,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 234 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:29,910 INFO L241 Difference]: Finished difference. Result has 49 places, 34 transitions, 121 flow [2021-03-11 19:58:29,911 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2021-03-11 19:58:29,911 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2021-03-11 19:58:29,911 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 121 flow [2021-03-11 19:58:29,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:29,911 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:29,911 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:29,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 19:58:29,912 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash 558436699, now seen corresponding path program 1 times [2021-03-11 19:58:29,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:29,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382482776] [2021-03-11 19:58:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:29,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:29,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:29,983 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:58:29,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:58:29,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:29,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:30,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382482776] [2021-03-11 19:58:30,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:30,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:58:30,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657279531] [2021-03-11 19:58:30,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:30,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:30,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:30,006 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 215 [2021-03-11 19:58:30,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:30,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 215 [2021-03-11 19:58:30,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:30,065 INFO L129 PetriNetUnfolder]: 149/310 cut-off events. [2021-03-11 19:58:30,065 INFO L130 PetriNetUnfolder]: For 400/479 co-relation queries the response was YES. [2021-03-11 19:58:30,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 310 events. 149/310 cut-off events. For 400/479 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1386 event pairs, 18 based on Foata normal form. 25/328 useless extension candidates. Maximal degree in co-relation 918. Up to 161 conditions per place. [2021-03-11 19:58:30,068 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 14 selfloop transitions, 3 changer transitions 9/47 dead transitions. [2021-03-11 19:58:30,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 238 flow [2021-03-11 19:58:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2021-03-11 19:58:30,070 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8176744186046512 [2021-03-11 19:58:30,070 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 879 transitions. [2021-03-11 19:58:30,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions. [2021-03-11 19:58:30,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:30,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions. [2021-03-11 19:58:30,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,074 INFO L185 Difference]: Start difference. First operand has 49 places, 34 transitions, 121 flow. Second operand 5 states and 879 transitions. [2021-03-11 19:58:30,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 238 flow [2021-03-11 19:58:30,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 226 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:30,077 INFO L241 Difference]: Finished difference. Result has 50 places, 34 transitions, 126 flow [2021-03-11 19:58:30,077 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2021-03-11 19:58:30,077 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2021-03-11 19:58:30,077 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 126 flow [2021-03-11 19:58:30,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,077 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:30,077 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:30,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 19:58:30,078 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash -765622441, now seen corresponding path program 1 times [2021-03-11 19:58:30,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:30,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372370022] [2021-03-11 19:58:30,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:30,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:30,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372370022] [2021-03-11 19:58:30,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:30,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:58:30,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495362554] [2021-03-11 19:58:30,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:58:30,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:58:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:58:30,133 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-11 19:58:30,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:30,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-11 19:58:30,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:30,164 INFO L129 PetriNetUnfolder]: 137/339 cut-off events. [2021-03-11 19:58:30,165 INFO L130 PetriNetUnfolder]: For 172/198 co-relation queries the response was YES. [2021-03-11 19:58:30,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 339 events. 137/339 cut-off events. For 172/198 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1900 event pairs, 60 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 781. Up to 176 conditions per place. [2021-03-11 19:58:30,167 INFO L132 encePairwiseOnDemand]: 209/215 looper letters, 5 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2021-03-11 19:58:30,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 154 flow [2021-03-11 19:58:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:58:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:58:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2021-03-11 19:58:30,168 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8821705426356589 [2021-03-11 19:58:30,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2021-03-11 19:58:30,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2021-03-11 19:58:30,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:30,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2021-03-11 19:58:30,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,171 INFO L185 Difference]: Start difference. First operand has 50 places, 34 transitions, 126 flow. Second operand 3 states and 569 transitions. [2021-03-11 19:58:30,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 154 flow [2021-03-11 19:58:30,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 144 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:30,173 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 149 flow [2021-03-11 19:58:30,173 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-11 19:58:30,174 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2021-03-11 19:58:30,174 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 149 flow [2021-03-11 19:58:30,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:30,174 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:30,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 19:58:30,174 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1456692556, now seen corresponding path program 1 times [2021-03-11 19:58:30,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:30,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116829459] [2021-03-11 19:58:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:30,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:30,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:30,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116829459] [2021-03-11 19:58:30,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:30,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:58:30,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997776055] [2021-03-11 19:58:30,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:30,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:30,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:30,247 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 215 [2021-03-11 19:58:30,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 177.2) internal successors, (886), 5 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:30,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 215 [2021-03-11 19:58:30,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:30,322 INFO L129 PetriNetUnfolder]: 302/738 cut-off events. [2021-03-11 19:58:30,322 INFO L130 PetriNetUnfolder]: For 455/540 co-relation queries the response was YES. [2021-03-11 19:58:30,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 738 events. 302/738 cut-off events. For 455/540 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5135 event pairs, 127 based on Foata normal form. 33/713 useless extension candidates. Maximal degree in co-relation 1749. Up to 373 conditions per place. [2021-03-11 19:58:30,326 INFO L132 encePairwiseOnDemand]: 211/215 looper letters, 8 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2021-03-11 19:58:30,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 192 flow [2021-03-11 19:58:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 891 transitions. [2021-03-11 19:58:30,328 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8288372093023256 [2021-03-11 19:58:30,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 891 transitions. [2021-03-11 19:58:30,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 891 transitions. [2021-03-11 19:58:30,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:30,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 891 transitions. [2021-03-11 19:58:30,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,332 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,332 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 149 flow. Second operand 5 states and 891 transitions. [2021-03-11 19:58:30,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 192 flow [2021-03-11 19:58:30,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:58:30,334 INFO L241 Difference]: Finished difference. Result has 53 places, 40 transitions, 171 flow [2021-03-11 19:58:30,334 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2021-03-11 19:58:30,334 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2021-03-11 19:58:30,334 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 171 flow [2021-03-11 19:58:30,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.2) internal successors, (886), 5 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,335 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:30,335 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:30,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 19:58:30,335 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -806989239, now seen corresponding path program 1 times [2021-03-11 19:58:30,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:30,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007993022] [2021-03-11 19:58:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:30,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:30,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007993022] [2021-03-11 19:58:30,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:30,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:58:30,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705850403] [2021-03-11 19:58:30,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:58:30,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:30,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:58:30,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:58:30,414 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-11 19:58:30,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:30,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-11 19:58:30,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:30,458 INFO L129 PetriNetUnfolder]: 165/459 cut-off events. [2021-03-11 19:58:30,458 INFO L130 PetriNetUnfolder]: For 410/546 co-relation queries the response was YES. [2021-03-11 19:58:30,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 459 events. 165/459 cut-off events. For 410/546 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2825 event pairs, 41 based on Foata normal form. 61/495 useless extension candidates. Maximal degree in co-relation 1314. Up to 233 conditions per place. [2021-03-11 19:58:30,460 INFO L132 encePairwiseOnDemand]: 209/215 looper letters, 5 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2021-03-11 19:58:30,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 215 flow [2021-03-11 19:58:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:58:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:58:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2021-03-11 19:58:30,462 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8825581395348837 [2021-03-11 19:58:30,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2021-03-11 19:58:30,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2021-03-11 19:58:30,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:30,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2021-03-11 19:58:30,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,465 INFO L185 Difference]: Start difference. First operand has 53 places, 40 transitions, 171 flow. Second operand 4 states and 759 transitions. [2021-03-11 19:58:30,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 215 flow [2021-03-11 19:58:30,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 212 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 19:58:30,467 INFO L241 Difference]: Finished difference. Result has 56 places, 44 transitions, 220 flow [2021-03-11 19:58:30,467 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2021-03-11 19:58:30,467 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2021-03-11 19:58:30,467 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 220 flow [2021-03-11 19:58:30,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,467 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:30,467 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:30,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 19:58:30,467 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 231339036, now seen corresponding path program 1 times [2021-03-11 19:58:30,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:30,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756967015] [2021-03-11 19:58:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:30,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:30,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:30,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756967015] [2021-03-11 19:58:30,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:30,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:58:30,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532374411] [2021-03-11 19:58:30,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:58:30,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:58:30,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:58:30,557 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-11 19:58:30,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:30,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-11 19:58:30,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:30,629 INFO L129 PetriNetUnfolder]: 95/285 cut-off events. [2021-03-11 19:58:30,629 INFO L130 PetriNetUnfolder]: For 361/584 co-relation queries the response was YES. [2021-03-11 19:58:30,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 285 events. 95/285 cut-off events. For 361/584 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1480 event pairs, 12 based on Foata normal form. 106/375 useless extension candidates. Maximal degree in co-relation 992. Up to 151 conditions per place. [2021-03-11 19:58:30,631 INFO L132 encePairwiseOnDemand]: 209/215 looper letters, 5 selfloop transitions, 13 changer transitions 1/48 dead transitions. [2021-03-11 19:58:30,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 280 flow [2021-03-11 19:58:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:58:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:58:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 949 transitions. [2021-03-11 19:58:30,633 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8827906976744186 [2021-03-11 19:58:30,633 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 949 transitions. [2021-03-11 19:58:30,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 949 transitions. [2021-03-11 19:58:30,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:30,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 949 transitions. [2021-03-11 19:58:30,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,637 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,637 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 220 flow. Second operand 5 states and 949 transitions. [2021-03-11 19:58:30,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 280 flow [2021-03-11 19:58:30,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 262 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-11 19:58:30,640 INFO L241 Difference]: Finished difference. Result has 59 places, 47 transitions, 260 flow [2021-03-11 19:58:30,641 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2021-03-11 19:58:30,641 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2021-03-11 19:58:30,641 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 260 flow [2021-03-11 19:58:30,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,641 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:30,641 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:30,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 19:58:30,641 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash -840143281, now seen corresponding path program 1 times [2021-03-11 19:58:30,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:30,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628303541] [2021-03-11 19:58:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:30,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:58:30,754 INFO L142 QuantifierPusher]: treesize reduction 34, result has 50.0 percent of original size [2021-03-11 19:58:30,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-11 19:58:30,781 INFO L142 QuantifierPusher]: treesize reduction 41, result has 44.6 percent of original size [2021-03-11 19:58:30,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 19:58:30,807 INFO L142 QuantifierPusher]: treesize reduction 49, result has 54.2 percent of original size [2021-03-11 19:58:30,808 INFO L147 QuantifierPusher]: treesize reduction 9, result has 84.5 percent of original size 49 [2021-03-11 19:58:30,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:30,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:30,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:30,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628303541] [2021-03-11 19:58:30,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:30,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:58:30,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611603238] [2021-03-11 19:58:30,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 19:58:30,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 19:58:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-03-11 19:58:30,858 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 215 [2021-03-11 19:58:30,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 159.125) internal successors, (1273), 8 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:30,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:30,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 215 [2021-03-11 19:58:30,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:31,190 INFO L129 PetriNetUnfolder]: 691/1538 cut-off events. [2021-03-11 19:58:31,190 INFO L130 PetriNetUnfolder]: For 1994/2507 co-relation queries the response was YES. [2021-03-11 19:58:31,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 1538 events. 691/1538 cut-off events. For 1994/2507 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11179 event pairs, 66 based on Foata normal form. 112/1515 useless extension candidates. Maximal degree in co-relation 4701. Up to 589 conditions per place. [2021-03-11 19:58:31,201 INFO L132 encePairwiseOnDemand]: 205/215 looper letters, 24 selfloop transitions, 15 changer transitions 5/81 dead transitions. [2021-03-11 19:58:31,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 460 flow [2021-03-11 19:58:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 19:58:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 19:58:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1309 transitions. [2021-03-11 19:58:31,203 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7610465116279069 [2021-03-11 19:58:31,203 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1309 transitions. [2021-03-11 19:58:31,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1309 transitions. [2021-03-11 19:58:31,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:31,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1309 transitions. [2021-03-11 19:58:31,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 163.625) internal successors, (1309), 8 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,208 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,208 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 260 flow. Second operand 8 states and 1309 transitions. [2021-03-11 19:58:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 460 flow [2021-03-11 19:58:31,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 418 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-11 19:58:31,222 INFO L241 Difference]: Finished difference. Result has 66 places, 60 transitions, 331 flow [2021-03-11 19:58:31,222 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2021-03-11 19:58:31,222 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2021-03-11 19:58:31,222 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 331 flow [2021-03-11 19:58:31,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 159.125) internal successors, (1273), 8 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,223 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:31,224 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:31,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 19:58:31,224 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:31,225 INFO L82 PathProgramCache]: Analyzing trace with hash 491891473, now seen corresponding path program 2 times [2021-03-11 19:58:31,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:31,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906388195] [2021-03-11 19:58:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:31,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:31,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:31,314 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-11 19:58:31,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 19:58:31,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:31,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 19:58:31,337 INFO L142 QuantifierPusher]: treesize reduction 28, result has 58.8 percent of original size [2021-03-11 19:58:31,339 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-11 19:58:31,355 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 19:58:31,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:58:31,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:31,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:31,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906388195] [2021-03-11 19:58:31,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:31,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:58:31,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300341236] [2021-03-11 19:58:31,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 19:58:31,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 19:58:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 19:58:31,376 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 215 [2021-03-11 19:58:31,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 331 flow. Second operand has 8 states, 8 states have (on average 147.625) internal successors, (1181), 8 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:31,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 215 [2021-03-11 19:58:31,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:31,883 INFO L129 PetriNetUnfolder]: 1568/3183 cut-off events. [2021-03-11 19:58:31,883 INFO L130 PetriNetUnfolder]: For 5450/6099 co-relation queries the response was YES. [2021-03-11 19:58:31,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11504 conditions, 3183 events. 1568/3183 cut-off events. For 5450/6099 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 24534 event pairs, 207 based on Foata normal form. 255/3309 useless extension candidates. Maximal degree in co-relation 11479. Up to 924 conditions per place. [2021-03-11 19:58:31,905 INFO L132 encePairwiseOnDemand]: 201/215 looper letters, 37 selfloop transitions, 32 changer transitions 9/105 dead transitions. [2021-03-11 19:58:31,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 796 flow [2021-03-11 19:58:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 19:58:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 19:58:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1526 transitions. [2021-03-11 19:58:31,908 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7097674418604651 [2021-03-11 19:58:31,908 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1526 transitions. [2021-03-11 19:58:31,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1526 transitions. [2021-03-11 19:58:31,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:31,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1526 transitions. [2021-03-11 19:58:31,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 152.6) internal successors, (1526), 10 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 215.0) internal successors, (2365), 11 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,914 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 215.0) internal successors, (2365), 11 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,914 INFO L185 Difference]: Start difference. First operand has 66 places, 60 transitions, 331 flow. Second operand 10 states and 1526 transitions. [2021-03-11 19:58:31,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 796 flow [2021-03-11 19:58:31,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 778 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-11 19:58:31,973 INFO L241 Difference]: Finished difference. Result has 76 places, 75 transitions, 542 flow [2021-03-11 19:58:31,973 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=542, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2021-03-11 19:58:31,973 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2021-03-11 19:58:31,973 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 542 flow [2021-03-11 19:58:31,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 147.625) internal successors, (1181), 8 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:31,974 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:31,974 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:31,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 19:58:31,974 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1966318129, now seen corresponding path program 3 times [2021-03-11 19:58:31,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:31,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125758674] [2021-03-11 19:58:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:32,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:32,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:32,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:32,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:58:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:32,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125758674] [2021-03-11 19:58:32,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:32,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:58:32,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545836012] [2021-03-11 19:58:32,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:58:32,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:58:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:58:32,053 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2021-03-11 19:58:32,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:32,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:32,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2021-03-11 19:58:32,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:32,260 INFO L129 PetriNetUnfolder]: 857/1883 cut-off events. [2021-03-11 19:58:32,260 INFO L130 PetriNetUnfolder]: For 5834/8094 co-relation queries the response was YES. [2021-03-11 19:58:32,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7729 conditions, 1883 events. 857/1883 cut-off events. For 5834/8094 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 14792 event pairs, 160 based on Foata normal form. 1103/2827 useless extension candidates. Maximal degree in co-relation 7704. Up to 583 conditions per place. [2021-03-11 19:58:32,275 INFO L132 encePairwiseOnDemand]: 209/215 looper letters, 1 selfloop transitions, 17 changer transitions 1/74 dead transitions. [2021-03-11 19:58:32,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 74 transitions, 572 flow [2021-03-11 19:58:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 19:58:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 19:58:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2021-03-11 19:58:32,280 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8798449612403101 [2021-03-11 19:58:32,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2021-03-11 19:58:32,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2021-03-11 19:58:32,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:32,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2021-03-11 19:58:32,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:32,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:32,284 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:32,284 INFO L185 Difference]: Start difference. First operand has 76 places, 75 transitions, 542 flow. Second operand 6 states and 1135 transitions. [2021-03-11 19:58:32,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 74 transitions, 572 flow [2021-03-11 19:58:32,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 508 flow, removed 24 selfloop flow, removed 6 redundant places. [2021-03-11 19:58:32,311 INFO L241 Difference]: Finished difference. Result has 74 places, 73 transitions, 510 flow [2021-03-11 19:58:32,311 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2021-03-11 19:58:32,311 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2021-03-11 19:58:32,311 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 510 flow [2021-03-11 19:58:32,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:32,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:32,311 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:32,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 19:58:32,312 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 286249739, now seen corresponding path program 1 times [2021-03-11 19:58:32,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:32,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995118889] [2021-03-11 19:58:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:32,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:32,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:58:32,406 INFO L142 QuantifierPusher]: treesize reduction 5, result has 76.2 percent of original size [2021-03-11 19:58:32,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 19:58:32,416 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-11 19:58:32,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 19:58:32,426 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-03-11 19:58:32,427 INFO L147 QuantifierPusher]: treesize reduction 9, result has 71.9 percent of original size 23 [2021-03-11 19:58:32,436 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-03-11 19:58:32,438 INFO L147 QuantifierPusher]: treesize reduction 9, result has 71.9 percent of original size 23 [2021-03-11 19:58:32,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 19:58:32,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 19:58:32,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:32,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:32,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995118889] [2021-03-11 19:58:32,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:32,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 19:58:32,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565686016] [2021-03-11 19:58:32,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 19:58:32,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 19:58:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-11 19:58:32,468 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 215 [2021-03-11 19:58:32,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 510 flow. Second operand has 10 states, 10 states have (on average 145.6) internal successors, (1456), 10 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:32,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:32,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 215 [2021-03-11 19:58:32,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:33,180 INFO L129 PetriNetUnfolder]: 2803/5191 cut-off events. [2021-03-11 19:58:33,181 INFO L130 PetriNetUnfolder]: For 13833/14708 co-relation queries the response was YES. [2021-03-11 19:58:33,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22630 conditions, 5191 events. 2803/5191 cut-off events. For 13833/14708 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 40732 event pairs, 153 based on Foata normal form. 19/5008 useless extension candidates. Maximal degree in co-relation 22603. Up to 1349 conditions per place. [2021-03-11 19:58:33,218 INFO L132 encePairwiseOnDemand]: 202/215 looper letters, 80 selfloop transitions, 29 changer transitions 23/158 dead transitions. [2021-03-11 19:58:33,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 158 transitions, 1381 flow [2021-03-11 19:58:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 19:58:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 19:58:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1653 transitions. [2021-03-11 19:58:33,221 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6989429175475688 [2021-03-11 19:58:33,221 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1653 transitions. [2021-03-11 19:58:33,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1653 transitions. [2021-03-11 19:58:33,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:33,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1653 transitions. [2021-03-11 19:58:33,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.27272727272728) internal successors, (1653), 11 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:33,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:33,235 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 215.0) internal successors, (2580), 12 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:33,235 INFO L185 Difference]: Start difference. First operand has 74 places, 73 transitions, 510 flow. Second operand 11 states and 1653 transitions. [2021-03-11 19:58:33,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 158 transitions, 1381 flow [2021-03-11 19:58:33,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 158 transitions, 1297 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-03-11 19:58:33,386 INFO L241 Difference]: Finished difference. Result has 84 places, 91 transitions, 669 flow [2021-03-11 19:58:33,387 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=669, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2021-03-11 19:58:33,387 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2021-03-11 19:58:33,387 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 669 flow [2021-03-11 19:58:33,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 145.6) internal successors, (1456), 10 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:33,388 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:33,388 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:33,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 19:58:33,388 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash 611357931, now seen corresponding path program 2 times [2021-03-11 19:58:33,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:33,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197463913] [2021-03-11 19:58:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:58:33,459 INFO L142 QuantifierPusher]: treesize reduction 60, result has 21.1 percent of original size [2021-03-11 19:58:33,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 19:58:33,468 INFO L142 QuantifierPusher]: treesize reduction 14, result has 90.7 percent of original size [2021-03-11 19:58:33,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2021-03-11 19:58:33,540 INFO L142 QuantifierPusher]: treesize reduction 4, result has 96.9 percent of original size [2021-03-11 19:58:33,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 126 [2021-03-11 19:58:33,599 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-11 19:58:33,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-11 19:58:33,640 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-11 19:58:33,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-11 19:58:33,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:33,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:58:33,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:58:33,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 19:58:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 19:58:33,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197463913] [2021-03-11 19:58:33,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:58:33,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 19:58:33,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455489672] [2021-03-11 19:58:33,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 19:58:33,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:58:33,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 19:58:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-11 19:58:33,690 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 215 [2021-03-11 19:58:33,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 669 flow. Second operand has 9 states, 9 states have (on average 155.11111111111111) internal successors, (1396), 9 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:33,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:58:33,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 215 [2021-03-11 19:58:33,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:58:34,299 INFO L129 PetriNetUnfolder]: 2040/4288 cut-off events. [2021-03-11 19:58:34,299 INFO L130 PetriNetUnfolder]: For 12228/14606 co-relation queries the response was YES. [2021-03-11 19:58:34,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16791 conditions, 4288 events. 2040/4288 cut-off events. For 12228/14606 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 37854 event pairs, 271 based on Foata normal form. 224/4143 useless extension candidates. Maximal degree in co-relation 16766. Up to 1061 conditions per place. [2021-03-11 19:58:34,323 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 31 selfloop transitions, 13 changer transitions 24/106 dead transitions. [2021-03-11 19:58:34,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 921 flow [2021-03-11 19:58:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 19:58:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 19:58:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1256 transitions. [2021-03-11 19:58:34,325 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7302325581395349 [2021-03-11 19:58:34,325 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1256 transitions. [2021-03-11 19:58:34,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1256 transitions. [2021-03-11 19:58:34,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:58:34,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1256 transitions. [2021-03-11 19:58:34,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 157.0) internal successors, (1256), 8 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:34,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:34,329 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:34,329 INFO L185 Difference]: Start difference. First operand has 84 places, 91 transitions, 669 flow. Second operand 8 states and 1256 transitions. [2021-03-11 19:58:34,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 921 flow [2021-03-11 19:58:34,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 106 transitions, 904 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-11 19:58:34,514 INFO L241 Difference]: Finished difference. Result has 90 places, 72 transitions, 522 flow [2021-03-11 19:58:34,514 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=522, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2021-03-11 19:58:34,514 INFO L335 CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places. [2021-03-11 19:58:34,514 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 522 flow [2021-03-11 19:58:34,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 155.11111111111111) internal successors, (1396), 9 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:58:34,515 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:58:34,515 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:58:34,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 19:58:34,515 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:58:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:58:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash -972077029, now seen corresponding path program 3 times [2021-03-11 19:58:34,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:58:34,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105525985] [2021-03-11 19:58:34,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:58:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:58:34,546 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:58:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:58:34,604 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:58:34,635 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 19:58:34,636 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 19:58:34,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 19:58:34,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 07:58:34 BasicIcfg [2021-03-11 19:58:34,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 19:58:34,722 INFO L168 Benchmark]: Toolchain (without parser) took 11772.75 ms. Allocated memory was 356.5 MB in the beginning and 687.9 MB in the end (delta: 331.4 MB). Free memory was 319.8 MB in the beginning and 621.0 MB in the end (delta: -301.2 MB). Peak memory consumption was 398.9 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:34,723 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 356.5 MB. Free memory was 338.0 MB in the beginning and 337.9 MB in the end (delta: 77.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 19:58:34,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.27 ms. Allocated memory is still 356.5 MB. Free memory was 319.2 MB in the beginning and 315.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:34,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.25 ms. Allocated memory is still 356.5 MB. Free memory was 315.2 MB in the beginning and 313.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:34,725 INFO L168 Benchmark]: Boogie Preprocessor took 44.60 ms. Allocated memory is still 356.5 MB. Free memory was 313.1 MB in the beginning and 309.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:34,728 INFO L168 Benchmark]: RCFGBuilder took 1438.37 ms. Allocated memory is still 356.5 MB. Free memory was 309.9 MB in the beginning and 218.4 MB in the end (delta: 91.5 MB). Peak memory consumption was 143.9 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:34,729 INFO L168 Benchmark]: TraceAbstraction took 9831.00 ms. Allocated memory was 356.5 MB in the beginning and 687.9 MB in the end (delta: 331.4 MB). Free memory was 218.4 MB in the beginning and 621.0 MB in the end (delta: -402.6 MB). Peak memory consumption was 295.7 MB. Max. memory is 16.0 GB. [2021-03-11 19:58:34,731 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 356.5 MB. Free memory was 338.0 MB in the beginning and 337.9 MB in the end (delta: 77.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 385.27 ms. Allocated memory is still 356.5 MB. Free memory was 319.2 MB in the beginning and 315.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.25 ms. Allocated memory is still 356.5 MB. Free memory was 315.2 MB in the beginning and 313.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.60 ms. Allocated memory is still 356.5 MB. Free memory was 313.1 MB in the beginning and 309.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1438.37 ms. Allocated memory is still 356.5 MB. Free memory was 309.9 MB in the beginning and 218.4 MB in the end (delta: 91.5 MB). Peak memory consumption was 143.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9831.00 ms. Allocated memory was 356.5 MB in the beginning and 687.9 MB in the end (delta: 331.4 MB). Free memory was 218.4 MB in the beginning and 621.0 MB in the end (delta: -402.6 MB). Peak memory consumption was 295.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4064.0ms, 128 PlacesBefore, 45 PlacesAfterwards, 117 TransitionsBefore, 33 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 9264 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5111, positive: 4862, positive conditional: 0, positive unconditional: 4862, negative: 249, negative conditional: 0, negative unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2079, positive: 2028, positive conditional: 0, positive unconditional: 2028, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2079, positive: 1990, positive conditional: 0, positive unconditional: 1990, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 443, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5111, positive: 2834, positive conditional: 0, positive unconditional: 2834, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 2079, unknown conditional: 0, unknown unconditional: 2079] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 345, Positive conditional cache size: 0, Positive unconditional cache size: 345, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t97; [L874] FCALL, FORK 0 pthread_create(&t97, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t98; [L876] FCALL, FORK 0 pthread_create(&t98, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t99; [L878] FCALL, FORK 0 pthread_create(&t99, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t100; [L880] FCALL, FORK 0 pthread_create(&t100, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9627.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3698.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4144.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 149 SDtfs, 151 SDslu, 264 SDs, 0 SdLazy, 720 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 620.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 810.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=12, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.4ms SsaConstructionTime, 525.8ms SatisfiabilityAnalysisTime, 962.3ms InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...