/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/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:16:01,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:16:01,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:16:02,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:16:02,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:16:02,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:16:02,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:16:02,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:16:02,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:16:02,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:16:02,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:16:02,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:16:02,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:16:02,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:16:02,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:16:02,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:16:02,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:16:02,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:16:02,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:16:02,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:16:02,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:16:02,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:16:02,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:16:02,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:16:02,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:16:02,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:16:02,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:16:02,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:16:02,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:16:02,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:16:02,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:16:02,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:16:02,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:16:02,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:16:02,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:16:02,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:16:02,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:16:02,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:16:02,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:16:02,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:16:02,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:16:02,047 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 20:16:02,076 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:16:02,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:16:02,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:16:02,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:16:02,079 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:16:02,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:16:02,079 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:16:02,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:16:02,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:16:02,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:16:02,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:16:02,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:16:02,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:16:02,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:16:02,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:16:02,083 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 20:16:02,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:16:02,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:16:02,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:16:02,334 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:16:02,335 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:16:02,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2021-03-11 20:16:02,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5f976be/320c6fb60efe4243bf392dd44d6640b3/FLAGee342eb85 [2021-03-11 20:16:02,824 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:16:02,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2021-03-11 20:16:02,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5f976be/320c6fb60efe4243bf392dd44d6640b3/FLAGee342eb85 [2021-03-11 20:16:02,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5f976be/320c6fb60efe4243bf392dd44d6640b3 [2021-03-11 20:16:02,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:16:02,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:16:02,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:16:02,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:16:02,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:16:02,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:16:02" (1/1) ... [2021-03-11 20:16:02,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36110120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:02, skipping insertion in model container [2021-03-11 20:16:02,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:16:02" (1/1) ... [2021-03-11 20:16:02,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:16:02,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:16:03,047 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/rfi001_rmo.opt.i[948,961] [2021-03-11 20:16:03,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:16:03,188 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:16:03,195 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/rfi001_rmo.opt.i[948,961] [2021-03-11 20:16:03,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:16:03,264 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:16:03,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03 WrapperNode [2021-03-11 20:16:03,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:16:03,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:16:03,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:16:03,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:16:03,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:16:03,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:16:03,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:16:03,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:16:03,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (1/1) ... [2021-03-11 20:16:03,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:16:03,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:16:03,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:16:03,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:16:03,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (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 20:16:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:16:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:16:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:16:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:16:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:16:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:16:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:16:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:16:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:16:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:16:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:16:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:16:03,366 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 20:16:04,803 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:16:04,803 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:16:04,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:16:04 BoogieIcfgContainer [2021-03-11 20:16:04,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:16:04,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:16:04,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:16:04,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:16:04,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:16:02" (1/3) ... [2021-03-11 20:16:04,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8cd8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:16:04, skipping insertion in model container [2021-03-11 20:16:04,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:16:03" (2/3) ... [2021-03-11 20:16:04,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8cd8ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:16:04, skipping insertion in model container [2021-03-11 20:16:04,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:16:04" (3/3) ... [2021-03-11 20:16:04,811 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2021-03-11 20:16:04,817 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:16:04,820 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:16:04,820 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:16:04,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,861 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:16:04,861 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:16:04,873 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 20:16:04,890 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:16:04,891 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:16:04,891 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:16:04,891 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:16:04,891 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:16:04,891 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:16:04,891 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:16:04,891 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:16:04,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-11 20:16:04,917 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-11 20:16:04,917 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:16:04,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-11 20:16:04,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-11 20:16:04,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-11 20:16:04,923 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:16:04,928 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-11 20:16:04,930 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-11 20:16:04,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-11 20:16:04,941 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-11 20:16:04,941 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:16:04,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-11 20:16:04,942 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-11 20:16:05,592 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:16:05,984 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:16:06,114 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:16:08,102 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2021-03-11 20:16:08,385 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-11 20:16:09,619 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 322 DAG size of output: 276 [2021-03-11 20:16:10,158 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-11 20:16:10,781 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2021-03-11 20:16:11,078 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-11 20:16:12,392 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-03-11 20:16:12,982 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-11 20:16:13,901 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-11 20:16:14,218 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-11 20:16:14,761 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 20:16:15,331 WARN L205 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 20:16:15,871 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-11 20:16:15,989 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-11 20:16:16,242 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-11 20:16:16,370 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-11 20:16:16,372 INFO L131 LiptonReduction]: Checked pairs total: 2797 [2021-03-11 20:16:16,372 INFO L133 LiptonReduction]: Total number of compositions: 71 [2021-03-11 20:16:16,373 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11452 [2021-03-11 20:16:16,382 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-03-11 20:16:16,382 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:16:16,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:16,382 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:16:16,382 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 888223153, now seen corresponding path program 1 times [2021-03-11 20:16:16,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:16,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568021624] [2021-03-11 20:16:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:16,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:16,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:16,567 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 20:16:16,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568021624] [2021-03-11 20:16:16,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:16,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:16:16,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260938854] [2021-03-11 20:16:16,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:16:16,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:16:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:16:16,583 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 155 [2021-03-11 20:16:16,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 20:16:16,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:16,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 155 [2021-03-11 20:16:16,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:16,649 INFO L129 PetriNetUnfolder]: 23/79 cut-off events. [2021-03-11 20:16:16,649 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:16:16,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 79 events. 23/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 309 event pairs, 3 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 125. Up to 37 conditions per place. [2021-03-11 20:16:16,651 INFO L132 encePairwiseOnDemand]: 152/155 looper letters, 7 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2021-03-11 20:16:16,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 70 flow [2021-03-11 20:16:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:16:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:16:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2021-03-11 20:16:16,664 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2021-03-11 20:16:16,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2021-03-11 20:16:16,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2021-03-11 20:16:16,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:16,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2021-03-11 20:16:16,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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 20:16:16,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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 20:16:16,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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 20:16:16,677 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 396 transitions. [2021-03-11 20:16:16,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 70 flow [2021-03-11 20:16:16,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:16:16,679 INFO L241 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2021-03-11 20:16:16,680 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2021-03-11 20:16:16,681 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2021-03-11 20:16:16,681 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2021-03-11 20:16:16,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 20:16:16,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:16,681 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:16,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:16:16,682 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1115990507, now seen corresponding path program 1 times [2021-03-11 20:16:16,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:16,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405359691] [2021-03-11 20:16:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:16,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:16,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:16,759 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 20:16:16,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405359691] [2021-03-11 20:16:16,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:16,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:16:16,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615882041] [2021-03-11 20:16:16,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:16:16,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:16:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:16:16,761 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 155 [2021-03-11 20:16:16,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 20:16:16,762 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:16,762 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 155 [2021-03-11 20:16:16,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:16,770 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-11 20:16:16,770 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:16:16,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 20:16:16,770 INFO L132 encePairwiseOnDemand]: 152/155 looper letters, 1 selfloop transitions, 2 changer transitions 0/16 dead transitions. [2021-03-11 20:16:16,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 16 transitions, 46 flow [2021-03-11 20:16:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:16:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:16:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2021-03-11 20:16:16,772 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8731182795698925 [2021-03-11 20:16:16,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2021-03-11 20:16:16,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2021-03-11 20:16:16,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:16,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2021-03-11 20:16:16,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 20:16:16,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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 20:16:16,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 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 20:16:16,775 INFO L185 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 406 transitions. [2021-03-11 20:16:16,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 16 transitions, 46 flow [2021-03-11 20:16:16,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 16 transitions, 42 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:16:16,776 INFO L241 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2021-03-11 20:16:16,776 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2021-03-11 20:16:16,776 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2021-03-11 20:16:16,777 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2021-03-11 20:16:16,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 20:16:16,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:16,777 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:16,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:16:16,779 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1274941407, now seen corresponding path program 1 times [2021-03-11 20:16:16,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:16,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560951730] [2021-03-11 20:16:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:16,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:16,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:16:16,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:16,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:16:16,868 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-11 20:16:16,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-11 20:16:16,888 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 20:16:16,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560951730] [2021-03-11 20:16:16,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:16,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:16:16,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968859985] [2021-03-11 20:16:16,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:16:16,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:16,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:16:16,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:16:16,891 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 155 [2021-03-11 20:16:16,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 20:16:16,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:16,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 155 [2021-03-11 20:16:16,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:16,948 INFO L129 PetriNetUnfolder]: 21/68 cut-off events. [2021-03-11 20:16:16,948 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-11 20:16:16,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 68 events. 21/68 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 128. Up to 40 conditions per place. [2021-03-11 20:16:16,949 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 8 selfloop transitions, 5 changer transitions 0/22 dead transitions. [2021-03-11 20:16:16,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 82 flow [2021-03-11 20:16:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:16:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:16:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2021-03-11 20:16:16,951 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7451612903225806 [2021-03-11 20:16:16,951 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2021-03-11 20:16:16,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2021-03-11 20:16:16,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:16,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2021-03-11 20:16:16,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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 20:16:16,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 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 20:16:16,954 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 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 20:16:16,954 INFO L185 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 4 states and 462 transitions. [2021-03-11 20:16:16,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 82 flow [2021-03-11 20:16:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:16:16,954 INFO L241 Difference]: Finished difference. Result has 27 places, 20 transitions, 72 flow [2021-03-11 20:16:16,955 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2021-03-11 20:16:16,955 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2021-03-11 20:16:16,955 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 72 flow [2021-03-11 20:16:16,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 20:16:16,955 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:16,955 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:16,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:16:16,955 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:16,956 INFO L82 PathProgramCache]: Analyzing trace with hash 537048685, now seen corresponding path program 1 times [2021-03-11 20:16:16,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:16,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776333661] [2021-03-11 20:16:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:17,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:16:17,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:16:17,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:16:17,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:16:17,074 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 20:16:17,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776333661] [2021-03-11 20:16:17,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:17,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:16:17,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53237344] [2021-03-11 20:16:17,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:16:17,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:16:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:16:17,076 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 155 [2021-03-11 20:16:17,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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 20:16:17,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:17,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 155 [2021-03-11 20:16:17,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:17,190 INFO L129 PetriNetUnfolder]: 20/71 cut-off events. [2021-03-11 20:16:17,190 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-11 20:16:17,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 71 events. 20/71 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 260 event pairs, 2 based on Foata normal form. 2/73 useless extension candidates. Maximal degree in co-relation 158. Up to 26 conditions per place. [2021-03-11 20:16:17,192 INFO L132 encePairwiseOnDemand]: 149/155 looper letters, 9 selfloop transitions, 9 changer transitions 0/27 dead transitions. [2021-03-11 20:16:17,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 126 flow [2021-03-11 20:16:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:16:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:16:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2021-03-11 20:16:17,194 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7509677419354839 [2021-03-11 20:16:17,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2021-03-11 20:16:17,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2021-03-11 20:16:17,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:17,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2021-03-11 20:16:17,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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 20:16:17,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 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 20:16:17,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 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 20:16:17,197 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 72 flow. Second operand 5 states and 582 transitions. [2021-03-11 20:16:17,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 126 flow [2021-03-11 20:16:17,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-11 20:16:17,198 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 114 flow [2021-03-11 20:16:17,198 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-03-11 20:16:17,198 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2021-03-11 20:16:17,199 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 114 flow [2021-03-11 20:16:17,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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 20:16:17,199 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:17,199 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:17,199 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:16:17,199 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1152970046, now seen corresponding path program 1 times [2021-03-11 20:16:17,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:17,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914513011] [2021-03-11 20:16:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:17,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:17,260 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:16:17,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:16:17,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:16:17,269 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 20:16:17,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914513011] [2021-03-11 20:16:17,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:17,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:16:17,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206295491] [2021-03-11 20:16:17,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:16:17,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:16:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:16:17,271 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 155 [2021-03-11 20:16:17,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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 20:16:17,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:17,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 155 [2021-03-11 20:16:17,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:17,325 INFO L129 PetriNetUnfolder]: 12/63 cut-off events. [2021-03-11 20:16:17,325 INFO L130 PetriNetUnfolder]: For 35/38 co-relation queries the response was YES. [2021-03-11 20:16:17,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 63 events. 12/63 cut-off events. For 35/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 4 based on Foata normal form. 8/69 useless extension candidates. Maximal degree in co-relation 147. Up to 25 conditions per place. [2021-03-11 20:16:17,326 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 4 selfloop transitions, 6 changer transitions 2/31 dead transitions. [2021-03-11 20:16:17,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 152 flow [2021-03-11 20:16:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:16:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:16:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2021-03-11 20:16:17,328 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.824516129032258 [2021-03-11 20:16:17,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2021-03-11 20:16:17,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2021-03-11 20:16:17,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:17,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2021-03-11 20:16:17,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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 20:16:17,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 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 20:16:17,331 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 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 20:16:17,331 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 114 flow. Second operand 5 states and 639 transitions. [2021-03-11 20:16:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 152 flow [2021-03-11 20:16:17,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 146 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-11 20:16:17,332 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 149 flow [2021-03-11 20:16:17,333 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-11 20:16:17,333 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2021-03-11 20:16:17,333 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 149 flow [2021-03-11 20:16:17,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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 20:16:17,333 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:17,333 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:17,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:16:17,333 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 505848599, now seen corresponding path program 1 times [2021-03-11 20:16:17,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:17,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112196036] [2021-03-11 20:16:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:17,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:17,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:17,399 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:16:17,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:16:17,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:16:17,412 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 20:16:17,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112196036] [2021-03-11 20:16:17,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:17,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:16:17,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009302374] [2021-03-11 20:16:17,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:16:17,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:16:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:16:17,414 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 155 [2021-03-11 20:16:17,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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 20:16:17,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:17,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 155 [2021-03-11 20:16:17,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:17,478 INFO L129 PetriNetUnfolder]: 6/47 cut-off events. [2021-03-11 20:16:17,478 INFO L130 PetriNetUnfolder]: For 51/70 co-relation queries the response was YES. [2021-03-11 20:16:17,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 47 events. 6/47 cut-off events. For 51/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 0 based on Foata normal form. 22/69 useless extension candidates. Maximal degree in co-relation 135. Up to 13 conditions per place. [2021-03-11 20:16:17,479 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 2 selfloop transitions, 9 changer transitions 2/32 dead transitions. [2021-03-11 20:16:17,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 187 flow [2021-03-11 20:16:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:16:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:16:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2021-03-11 20:16:17,481 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8202764976958525 [2021-03-11 20:16:17,481 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2021-03-11 20:16:17,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2021-03-11 20:16:17,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:17,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2021-03-11 20:16:17,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 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 20:16:17,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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 20:16:17,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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 20:16:17,486 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 149 flow. Second operand 7 states and 890 transitions. [2021-03-11 20:16:17,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 187 flow [2021-03-11 20:16:17,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 32 transitions, 181 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-11 20:16:17,488 INFO L241 Difference]: Finished difference. Result has 47 places, 30 transitions, 179 flow [2021-03-11 20:16:17,488 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2021-03-11 20:16:17,488 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 22 predicate places. [2021-03-11 20:16:17,488 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 179 flow [2021-03-11 20:16:17,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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 20:16:17,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:17,489 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:17,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:16:17,489 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash 938911809, now seen corresponding path program 1 times [2021-03-11 20:16:17,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:17,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606100098] [2021-03-11 20:16:17,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:16:17,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:16:17,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:17,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:16:17,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:16:17,540 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 20:16:17,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606100098] [2021-03-11 20:16:17,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:16:17,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:16:17,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119145589] [2021-03-11 20:16:17,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:16:17,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:16:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:16:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:16:17,543 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2021-03-11 20:16:17,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 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 20:16:17,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:16:17,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2021-03-11 20:16:17,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:16:17,569 INFO L129 PetriNetUnfolder]: 8/70 cut-off events. [2021-03-11 20:16:17,569 INFO L130 PetriNetUnfolder]: For 125/126 co-relation queries the response was YES. [2021-03-11 20:16:17,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 70 events. 8/70 cut-off events. For 125/126 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 0 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 226. Up to 22 conditions per place. [2021-03-11 20:16:17,570 INFO L132 encePairwiseOnDemand]: 152/155 looper letters, 3 selfloop transitions, 1 changer transitions 6/31 dead transitions. [2021-03-11 20:16:17,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 191 flow [2021-03-11 20:16:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:16:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:16:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2021-03-11 20:16:17,572 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8483870967741935 [2021-03-11 20:16:17,572 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2021-03-11 20:16:17,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2021-03-11 20:16:17,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:16:17,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2021-03-11 20:16:17,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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 20:16:17,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 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 20:16:17,576 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 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 20:16:17,576 INFO L185 Difference]: Start difference. First operand has 47 places, 30 transitions, 179 flow. Second operand 4 states and 526 transitions. [2021-03-11 20:16:17,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 191 flow [2021-03-11 20:16:17,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 166 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-11 20:16:17,580 INFO L241 Difference]: Finished difference. Result has 45 places, 25 transitions, 131 flow [2021-03-11 20:16:17,580 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2021-03-11 20:16:17,580 INFO L335 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2021-03-11 20:16:17,581 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 131 flow [2021-03-11 20:16:17,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 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 20:16:17,581 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:16:17,581 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:16:17,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:16:17,581 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:16:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:16:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash 544120549, now seen corresponding path program 2 times [2021-03-11 20:16:17,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:16:17,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371378110] [2021-03-11 20:16:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:16:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:16:17,633 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:16:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:16:17,677 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:16:17,706 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:16:17,707 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:16:17,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:16:17,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:16:17 BasicIcfg [2021-03-11 20:16:17,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:16:17,766 INFO L168 Benchmark]: Toolchain (without parser) took 14910.06 ms. Allocated memory was 367.0 MB in the beginning and 639.6 MB in the end (delta: 272.6 MB). Free memory was 330.3 MB in the beginning and 523.8 MB in the end (delta: -193.5 MB). Peak memory consumption was 80.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:16:17,766 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 367.0 MB. Free memory was 348.3 MB in the beginning and 348.3 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:16:17,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.56 ms. Allocated memory is still 367.0 MB. Free memory was 329.7 MB in the beginning and 326.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-11 20:16:17,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.18 ms. Allocated memory is still 367.0 MB. Free memory was 326.6 MB in the beginning and 324.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:16:17,770 INFO L168 Benchmark]: Boogie Preprocessor took 18.33 ms. Allocated memory is still 367.0 MB. Free memory was 324.5 MB in the beginning and 322.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:16:17,770 INFO L168 Benchmark]: RCFGBuilder took 1488.44 ms. Allocated memory is still 367.0 MB. Free memory was 322.5 MB in the beginning and 308.0 MB in the end (delta: 14.4 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:16:17,771 INFO L168 Benchmark]: TraceAbstraction took 12957.74 ms. Allocated memory was 367.0 MB in the beginning and 639.6 MB in the end (delta: 272.6 MB). Free memory was 308.0 MB in the beginning and 523.8 MB in the end (delta: -215.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:16:17,778 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.09 ms. Allocated memory is still 367.0 MB. Free memory was 348.3 MB in the beginning and 348.3 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 404.56 ms. Allocated memory is still 367.0 MB. Free memory was 329.7 MB in the beginning and 326.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.18 ms. Allocated memory is still 367.0 MB. Free memory was 326.6 MB in the beginning and 324.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.33 ms. Allocated memory is still 367.0 MB. Free memory was 324.5 MB in the beginning and 322.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1488.44 ms. Allocated memory is still 367.0 MB. Free memory was 322.5 MB in the beginning and 308.0 MB in the end (delta: 14.4 MB). Peak memory consumption was 167.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12957.74 ms. Allocated memory was 367.0 MB in the beginning and 639.6 MB in the end (delta: 272.6 MB). Free memory was 308.0 MB in the beginning and 523.8 MB in the end (delta: -215.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11442.4ms, 87 PlacesBefore, 25 PlacesAfterwards, 82 TransitionsBefore, 18 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, 2797 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1062, positive: 914, positive conditional: 0, positive unconditional: 914, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 651, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 651, positive: 605, positive conditional: 0, positive unconditional: 605, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 746, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 686, negative conditional: 0, negative unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1062, positive: 305, positive conditional: 0, positive unconditional: 305, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 651, unknown conditional: 0, unknown unconditional: 651] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1611; [L803] FCALL, FORK 0 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1612; [L805] FCALL, FORK 0 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12819.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 482.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11488.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 8 SDslu, 7 SDs, 0 SdLazy, 102 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 138.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 209.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=6, InterpolantAutomatonStates: 31, 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: 19.4ms SsaConstructionTime, 253.7ms SatisfiabilityAnalysisTime, 379.0ms InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...