/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 12:53:49,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 12:53:49,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 12:53:49,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 12:53:49,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 12:53:49,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 12:53:49,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 12:53:49,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 12:53:49,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 12:53:49,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 12:53:49,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 12:53:49,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 12:53:49,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 12:53:49,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 12:53:49,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 12:53:49,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 12:53:49,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 12:53:49,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 12:53:49,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 12:53:49,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 12:53:49,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 12:53:49,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 12:53:49,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 12:53:49,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 12:53:49,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 12:53:49,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 12:53:49,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 12:53:49,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 12:53:49,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 12:53:49,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 12:53:49,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 12:53:49,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 12:53:49,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 12:53:49,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 12:53:49,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 12:53:49,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 12:53:49,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 12:53:49,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 12:53:49,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 12:53:49,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 12:53:49,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 12:53:49,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-09 12:53:49,866 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 12:53:49,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 12:53:49,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 12:53:49,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 12:53:49,868 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 12:53:49,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 12:53:49,869 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 12:53:49,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 12:53:49,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 12:53:49,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 12:53:49,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 12:53:49,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 12:53:49,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 12:53:49,871 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 12:53:49,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 12:53:49,872 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 12:53:49,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 12:53:49,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 12:53:49,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 12:53:49,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 12:53:49,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 12:53:49,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:53:49,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 12:53:49,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 12:53:49,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 12:53:49,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 12:53:49,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 12:53:49,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 12:53:49,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 12:53:49,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 12:53:50,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 12:53:50,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 12:53:50,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 12:53:50,186 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 12:53:50,187 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 12:53:50,187 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2020-10-09 12:53:50,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2f90c89/b354ddcc5269468ea7fc474697449536/FLAGa4424652c [2020-10-09 12:53:50,778 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 12:53:50,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2020-10-09 12:53:50,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2f90c89/b354ddcc5269468ea7fc474697449536/FLAGa4424652c [2020-10-09 12:53:51,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2f90c89/b354ddcc5269468ea7fc474697449536 [2020-10-09 12:53:51,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 12:53:51,083 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 12:53:51,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 12:53:51,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 12:53:51,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 12:53:51,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2505dd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51, skipping insertion in model container [2020-10-09 12:53:51,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 12:53:51,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 12:53:51,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:53:51,713 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 12:53:51,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:53:51,902 INFO L208 MainTranslator]: Completed translation [2020-10-09 12:53:51,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51 WrapperNode [2020-10-09 12:53:51,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 12:53:51,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 12:53:51,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 12:53:51,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 12:53:51,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 12:53:51,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 12:53:51,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 12:53:51,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 12:53:51,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:51,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:52,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:52,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... [2020-10-09 12:53:52,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 12:53:52,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 12:53:52,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 12:53:52,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 12:53:52,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:53:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 12:53:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 12:53:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 12:53:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 12:53:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 12:53:52,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 12:53:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 12:53:52,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 12:53:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 12:53:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 12:53:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 12:53:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 12:53:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 12:53:52,081 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 12:53:53,971 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 12:53:53,972 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 12:53:53,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:53:53 BoogieIcfgContainer [2020-10-09 12:53:53,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 12:53:53,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 12:53:53,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 12:53:53,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 12:53:53,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:53:51" (1/3) ... [2020-10-09 12:53:53,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f79feb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:53:53, skipping insertion in model container [2020-10-09 12:53:53,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:53:51" (2/3) ... [2020-10-09 12:53:53,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f79feb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:53:53, skipping insertion in model container [2020-10-09 12:53:53,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:53:53" (3/3) ... [2020-10-09 12:53:53,983 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2020-10-09 12:53:53,996 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 12:53:53,996 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 12:53:54,004 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 12:53:54,005 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 12:53:54,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,038 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,048 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,048 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,048 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,049 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,049 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,049 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,052 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,052 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,052 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,053 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,060 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,068 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,069 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:53:54,093 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 12:53:54,115 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 12:53:54,115 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 12:53:54,115 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 12:53:54,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 12:53:54,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 12:53:54,116 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 12:53:54,116 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 12:53:54,116 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 12:53:54,130 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 12:53:54,133 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-09 12:53:54,136 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-09 12:53:54,138 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-09 12:53:54,186 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-09 12:53:54,186 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 12:53:54,192 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-09 12:53:54,196 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544 [2020-10-09 12:53:54,676 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-09 12:53:54,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:54,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:54,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:54,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:54,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:54,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:54,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:54,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:54,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:54,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:54,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:54,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:54,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:54,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:54,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:54,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:54,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:53:54,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:53:55,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:53:55,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,380 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-09 12:53:55,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:55,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:55,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:55,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:55,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:55,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:55,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:55,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:55,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:55,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:55,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:55,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:55,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:55,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:55,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:55,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:55,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:53:55,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:53:55,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:55,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:55,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:55,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:55,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:55,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:55,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:55,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:55,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:55,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:55,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,115 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 12:53:56,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:53:56,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:53:56,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:56,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:53:56,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:56,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:53:56,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:53:56,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:56,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:53:56,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:53:56,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:56,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:56,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:57,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:57,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:57,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:57,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:57,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:57,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:57,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:57,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:53:57,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:57,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:57,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:57,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:53:57,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:53:57,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:57,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:57,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:53:57,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:53:57,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:53:57,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:53:57,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:53:57,936 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-09 12:53:58,045 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-09 12:53:58,061 INFO L132 LiptonReduction]: Checked pairs total: 4006 [2020-10-09 12:53:58,062 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-09 12:53:58,069 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-09 12:53:58,109 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states. [2020-10-09 12:53:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states. [2020-10-09 12:53:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-09 12:53:58,117 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:58,118 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-09 12:53:58,118 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:58,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 914642709, now seen corresponding path program 1 times [2020-10-09 12:53:58,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:58,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681209256] [2020-10-09 12:53:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:58,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681209256] [2020-10-09 12:53:58,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:58,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:53:58,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157628637] [2020-10-09 12:53:58,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:53:58,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:53:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:58,374 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states. [2020-10-09 12:53:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:58,461 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-09 12:53:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:53:58,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-09 12:53:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:58,485 INFO L225 Difference]: With dead ends: 550 [2020-10-09 12:53:58,485 INFO L226 Difference]: Without dead ends: 450 [2020-10-09 12:53:58,486 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-09 12:53:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-09 12:53:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-09 12:53:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-09 12:53:58,571 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5 [2020-10-09 12:53:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:58,571 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-09 12:53:58,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:53:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-09 12:53:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 12:53:58,573 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:58,573 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:58,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 12:53:58,574 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 577618716, now seen corresponding path program 1 times [2020-10-09 12:53:58,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:58,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780717990] [2020-10-09 12:53:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:58,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780717990] [2020-10-09 12:53:58,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:58,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:53:58,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544728134] [2020-10-09 12:53:58,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:53:58,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:58,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:53:58,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:58,693 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-09 12:53:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:58,710 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-09 12:53:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:53:58,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-09 12:53:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:58,715 INFO L225 Difference]: With dead ends: 440 [2020-10-09 12:53:58,716 INFO L226 Difference]: Without dead ends: 440 [2020-10-09 12:53:58,716 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-09 12:53:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-09 12:53:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-09 12:53:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-09 12:53:58,748 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-09 12:53:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:58,749 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-09 12:53:58,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:53:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-09 12:53:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-09 12:53:58,750 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:58,751 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:58,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 12:53:58,751 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash 644629497, now seen corresponding path program 1 times [2020-10-09 12:53:58,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:58,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940232892] [2020-10-09 12:53:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:58,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940232892] [2020-10-09 12:53:58,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:58,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:53:58,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442711261] [2020-10-09 12:53:58,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:53:58,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:53:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:58,810 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-09 12:53:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:58,820 INFO L93 Difference]: Finished difference Result 422 states and 1257 transitions. [2020-10-09 12:53:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:53:58,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-09 12:53:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:58,824 INFO L225 Difference]: With dead ends: 422 [2020-10-09 12:53:58,824 INFO L226 Difference]: Without dead ends: 422 [2020-10-09 12:53:58,824 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-09 12:53:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-10-09 12:53:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-09 12:53:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1257 transitions. [2020-10-09 12:53:58,843 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1257 transitions. Word has length 10 [2020-10-09 12:53:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:58,843 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1257 transitions. [2020-10-09 12:53:58,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:53:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1257 transitions. [2020-10-09 12:53:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 12:53:58,850 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:58,852 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:58,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 12:53:58,852 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1491369423, now seen corresponding path program 1 times [2020-10-09 12:53:58,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:58,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332175442] [2020-10-09 12:53:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:58,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332175442] [2020-10-09 12:53:58,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:58,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:53:58,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51621943] [2020-10-09 12:53:58,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:53:58,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:58,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:53:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:53:58,927 INFO L87 Difference]: Start difference. First operand 422 states and 1257 transitions. Second operand 4 states. [2020-10-09 12:53:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:58,964 INFO L93 Difference]: Finished difference Result 899 states and 2604 transitions. [2020-10-09 12:53:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:53:58,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-09 12:53:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:58,969 INFO L225 Difference]: With dead ends: 899 [2020-10-09 12:53:58,969 INFO L226 Difference]: Without dead ends: 566 [2020-10-09 12:53:58,970 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-10-09 12:53:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 422. [2020-10-09 12:53:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-09 12:53:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1224 transitions. [2020-10-09 12:53:58,985 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1224 transitions. Word has length 11 [2020-10-09 12:53:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:58,985 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1224 transitions. [2020-10-09 12:53:58,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:53:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1224 transitions. [2020-10-09 12:53:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 12:53:58,987 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:58,987 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:58,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 12:53:58,987 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1039296419, now seen corresponding path program 2 times [2020-10-09 12:53:58,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:58,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245729083] [2020-10-09 12:53:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245729083] [2020-10-09 12:53:59,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:53:59,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803048313] [2020-10-09 12:53:59,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:53:59,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:53:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:53:59,033 INFO L87 Difference]: Start difference. First operand 422 states and 1224 transitions. Second operand 4 states. [2020-10-09 12:53:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,058 INFO L93 Difference]: Finished difference Result 542 states and 1550 transitions. [2020-10-09 12:53:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:53:59,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-09 12:53:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,061 INFO L225 Difference]: With dead ends: 542 [2020-10-09 12:53:59,061 INFO L226 Difference]: Without dead ends: 302 [2020-10-09 12:53:59,061 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-09 12:53:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-10-09 12:53:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-09 12:53:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 832 transitions. [2020-10-09 12:53:59,070 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 832 transitions. Word has length 11 [2020-10-09 12:53:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,070 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 832 transitions. [2020-10-09 12:53:59,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:53:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 832 transitions. [2020-10-09 12:53:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-09 12:53:59,072 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,072 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 12:53:59,072 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1776505378, now seen corresponding path program 1 times [2020-10-09 12:53:59,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357070345] [2020-10-09 12:53:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357070345] [2020-10-09 12:53:59,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:53:59,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642185660] [2020-10-09 12:53:59,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:53:59,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:53:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:59,112 INFO L87 Difference]: Start difference. First operand 302 states and 832 transitions. Second operand 3 states. [2020-10-09 12:53:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,127 INFO L93 Difference]: Finished difference Result 398 states and 1088 transitions. [2020-10-09 12:53:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:53:59,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-09 12:53:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,129 INFO L225 Difference]: With dead ends: 398 [2020-10-09 12:53:59,129 INFO L226 Difference]: Without dead ends: 209 [2020-10-09 12:53:59,130 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-09 12:53:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-09 12:53:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-09 12:53:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 572 transitions. [2020-10-09 12:53:59,136 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 572 transitions. Word has length 12 [2020-10-09 12:53:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,136 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 572 transitions. [2020-10-09 12:53:59,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:53:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 572 transitions. [2020-10-09 12:53:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 12:53:59,137 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,137 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 12:53:59,138 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 762867507, now seen corresponding path program 1 times [2020-10-09 12:53:59,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367231722] [2020-10-09 12:53:59,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367231722] [2020-10-09 12:53:59,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:53:59,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126751649] [2020-10-09 12:53:59,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:53:59,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:53:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:59,179 INFO L87 Difference]: Start difference. First operand 209 states and 572 transitions. Second operand 3 states. [2020-10-09 12:53:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,185 INFO L93 Difference]: Finished difference Result 200 states and 542 transitions. [2020-10-09 12:53:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:53:59,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-09 12:53:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,190 INFO L225 Difference]: With dead ends: 200 [2020-10-09 12:53:59,190 INFO L226 Difference]: Without dead ends: 200 [2020-10-09 12:53:59,190 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:53:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-09 12:53:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2020-10-09 12:53:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-09 12:53:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 542 transitions. [2020-10-09 12:53:59,198 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 542 transitions. Word has length 13 [2020-10-09 12:53:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,199 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 542 transitions. [2020-10-09 12:53:59,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:53:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 542 transitions. [2020-10-09 12:53:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 12:53:59,200 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,200 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 12:53:59,200 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2120975707, now seen corresponding path program 1 times [2020-10-09 12:53:59,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892982790] [2020-10-09 12:53:59,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892982790] [2020-10-09 12:53:59,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:53:59,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501871703] [2020-10-09 12:53:59,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:53:59,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:53:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:53:59,258 INFO L87 Difference]: Start difference. First operand 200 states and 542 transitions. Second operand 4 states. [2020-10-09 12:53:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,286 INFO L93 Difference]: Finished difference Result 281 states and 758 transitions. [2020-10-09 12:53:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:53:59,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-09 12:53:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,288 INFO L225 Difference]: With dead ends: 281 [2020-10-09 12:53:59,288 INFO L226 Difference]: Without dead ends: 173 [2020-10-09 12:53:59,289 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-09 12:53:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-09 12:53:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-09 12:53:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 452 transitions. [2020-10-09 12:53:59,295 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 452 transitions. Word has length 14 [2020-10-09 12:53:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,295 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 452 transitions. [2020-10-09 12:53:59,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:53:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 452 transitions. [2020-10-09 12:53:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 12:53:59,296 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,296 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 12:53:59,297 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2121696457, now seen corresponding path program 2 times [2020-10-09 12:53:59,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244764937] [2020-10-09 12:53:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244764937] [2020-10-09 12:53:59,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:53:59,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181070668] [2020-10-09 12:53:59,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:53:59,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:53:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:53:59,476 INFO L87 Difference]: Start difference. First operand 173 states and 452 transitions. Second operand 4 states. [2020-10-09 12:53:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,507 INFO L93 Difference]: Finished difference Result 173 states and 397 transitions. [2020-10-09 12:53:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:53:59,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-09 12:53:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,509 INFO L225 Difference]: With dead ends: 173 [2020-10-09 12:53:59,509 INFO L226 Difference]: Without dead ends: 129 [2020-10-09 12:53:59,510 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-09 12:53:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-10-09 12:53:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-09 12:53:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 292 transitions. [2020-10-09 12:53:59,515 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 292 transitions. Word has length 14 [2020-10-09 12:53:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,515 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 292 transitions. [2020-10-09 12:53:59,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:53:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 292 transitions. [2020-10-09 12:53:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 12:53:59,516 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,516 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 12:53:59,517 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1022421451, now seen corresponding path program 1 times [2020-10-09 12:53:59,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623124802] [2020-10-09 12:53:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623124802] [2020-10-09 12:53:59,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:53:59,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292857661] [2020-10-09 12:53:59,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:53:59,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:53:59,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:53:59,602 INFO L87 Difference]: Start difference. First operand 129 states and 292 transitions. Second operand 5 states. [2020-10-09 12:53:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,644 INFO L93 Difference]: Finished difference Result 107 states and 211 transitions. [2020-10-09 12:53:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:53:59,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-09 12:53:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,645 INFO L225 Difference]: With dead ends: 107 [2020-10-09 12:53:59,645 INFO L226 Difference]: Without dead ends: 81 [2020-10-09 12:53:59,646 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-09 12:53:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-10-09 12:53:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-09 12:53:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 152 transitions. [2020-10-09 12:53:59,648 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 152 transitions. Word has length 16 [2020-10-09 12:53:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,649 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 152 transitions. [2020-10-09 12:53:59,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:53:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 152 transitions. [2020-10-09 12:53:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 12:53:59,650 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,650 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 12:53:59,650 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2141011581, now seen corresponding path program 1 times [2020-10-09 12:53:59,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881868253] [2020-10-09 12:53:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:53:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:53:59,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881868253] [2020-10-09 12:53:59,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:53:59,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:53:59,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285741341] [2020-10-09 12:53:59,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:53:59,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:53:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:53:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:53:59,770 INFO L87 Difference]: Start difference. First operand 81 states and 152 transitions. Second operand 6 states. [2020-10-09 12:53:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:53:59,830 INFO L93 Difference]: Finished difference Result 69 states and 126 transitions. [2020-10-09 12:53:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:53:59,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-09 12:53:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:53:59,831 INFO L225 Difference]: With dead ends: 69 [2020-10-09 12:53:59,831 INFO L226 Difference]: Without dead ends: 61 [2020-10-09 12:53:59,832 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:53:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-09 12:53:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-09 12:53:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-09 12:53:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2020-10-09 12:53:59,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 18 [2020-10-09 12:53:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:53:59,834 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions. [2020-10-09 12:53:59,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:53:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2020-10-09 12:53:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 12:53:59,835 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:53:59,835 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:53:59,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 12:53:59,835 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:53:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:53:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -280198634, now seen corresponding path program 1 times [2020-10-09 12:53:59,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:53:59,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635061797] [2020-10-09 12:53:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:53:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:54:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:54:00,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635061797] [2020-10-09 12:54:00,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:54:00,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:54:00,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349363146] [2020-10-09 12:54:00,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:54:00,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:54:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:54:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:54:00,172 INFO L87 Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 7 states. [2020-10-09 12:54:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:54:00,311 INFO L93 Difference]: Finished difference Result 75 states and 134 transitions. [2020-10-09 12:54:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:54:00,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-09 12:54:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:54:00,313 INFO L225 Difference]: With dead ends: 75 [2020-10-09 12:54:00,313 INFO L226 Difference]: Without dead ends: 41 [2020-10-09 12:54:00,313 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-09 12:54:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-09 12:54:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-09 12:54:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-09 12:54:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-09 12:54:00,316 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20 [2020-10-09 12:54:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:54:00,316 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-09 12:54:00,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:54:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-09 12:54:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 12:54:00,317 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:54:00,317 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:54:00,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 12:54:00,318 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:54:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:54:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1827958826, now seen corresponding path program 2 times [2020-10-09 12:54:00,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:54:00,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925055173] [2020-10-09 12:54:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:54:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:54:00,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:54:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:54:00,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:54:00,531 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 12:54:00,531 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 12:54:00,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 12:54:00,533 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 12:54:00,554 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L3-->L836: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-141737422 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-141737422 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-141737422 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-141737422 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-141737422 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-141737422|) (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out-141737422 0)) (and (= ~x$w_buff1_used~0_In-141737422 ~x$w_buff1_used~0_Out-141737422) .cse2)) (= ~x$r_buff1_thd0~0_Out-141737422 ~x$r_buff1_thd0~0_In-141737422) (or (and (= ~x$w_buff0_used~0_In-141737422 ~x$w_buff0_used~0_Out-141737422) .cse3) (and (= ~x$w_buff0_used~0_Out-141737422 0) .cse4 .cse5)) (= ~x$r_buff0_thd0~0_Out-141737422 ~x$r_buff0_thd0~0_In-141737422) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-141737422 0)) (or (and (or (and .cse2 (= ~x~0_In-141737422 ~x~0_Out-141737422)) (and (= ~x~0_Out-141737422 ~x$w_buff1~0_In-141737422) .cse0 .cse1)) .cse3) (and (= ~x~0_Out-141737422 ~x$w_buff0~0_In-141737422) .cse4 .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-141737422, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-141737422, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-141737422|, ~x$w_buff1~0=~x$w_buff1~0_In-141737422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-141737422, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-141737422, ~x~0=~x~0_In-141737422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-141737422} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-141737422, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-141737422, ~x$w_buff1~0=~x$w_buff1~0_In-141737422, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-141737422, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-141737422, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-141737422|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-141737422|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-141737422|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-141737422, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-141737422|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-141737422|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-141737422|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-141737422|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-141737422, ~x~0=~x~0_Out-141737422} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2020-10-09 12:54:00,563 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,569 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,571 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,572 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,573 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:54:00,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:54:00,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:54:00 BasicIcfg [2020-10-09 12:54:00,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 12:54:00,703 INFO L168 Benchmark]: Toolchain (without parser) took 9616.10 ms. Allocated memory was 252.7 MB in the beginning and 498.6 MB in the end (delta: 245.9 MB). Free memory was 207.1 MB in the beginning and 422.6 MB in the end (delta: -215.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. [2020-10-09 12:54:00,704 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-09 12:54:00,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.37 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 207.1 MB in the beginning and 270.2 MB in the end (delta: -63.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:54:00,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.79 ms. Allocated memory is still 318.8 MB. Free memory was 270.2 MB in the beginning and 267.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:54:00,710 INFO L168 Benchmark]: Boogie Preprocessor took 45.23 ms. Allocated memory is still 318.8 MB. Free memory was 267.6 MB in the beginning and 265.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:54:00,714 INFO L168 Benchmark]: RCFGBuilder took 1962.97 ms. Allocated memory was 318.8 MB in the beginning and 359.7 MB in the end (delta: 40.9 MB). Free memory was 265.0 MB in the beginning and 211.5 MB in the end (delta: 53.5 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.2 GB. [2020-10-09 12:54:00,718 INFO L168 Benchmark]: TraceAbstraction took 6720.77 ms. Allocated memory was 359.7 MB in the beginning and 498.6 MB in the end (delta: 138.9 MB). Free memory was 211.5 MB in the beginning and 422.6 MB in the end (delta: -211.1 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:54:00,724 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 252.7 MB. Free memory was 230.8 MB in the beginning and 229.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 819.37 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 207.1 MB in the beginning and 270.2 MB in the end (delta: -63.1 MB). Peak memory consumption was 34.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 61.79 ms. Allocated memory is still 318.8 MB. Free memory was 270.2 MB in the beginning and 267.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.23 ms. Allocated memory is still 318.8 MB. Free memory was 267.6 MB in the beginning and 265.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1962.97 ms. Allocated memory was 318.8 MB in the beginning and 359.7 MB in the end (delta: 40.9 MB). Free memory was 265.0 MB in the beginning and 211.5 MB in the end (delta: 53.5 MB). Peak memory consumption was 100.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6720.77 ms. Allocated memory was 359.7 MB in the beginning and 498.6 MB in the end (delta: 138.9 MB). Free memory was 211.5 MB in the beginning and 422.6 MB in the end (delta: -211.1 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1055 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 118 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.9s, 100 PlacesBefore, 35 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4006 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L710] 0 _Bool x$flush_delayed; [L711] 0 int x$mem_tmp; [L712] 0 _Bool x$r_buff0_thd0; [L713] 0 _Bool x$r_buff0_thd1; [L714] 0 _Bool x$r_buff0_thd2; [L715] 0 _Bool x$r_buff0_thd3; [L716] 0 _Bool x$r_buff1_thd0; [L717] 0 _Bool x$r_buff1_thd1; [L718] 0 _Bool x$r_buff1_thd2; [L719] 0 _Bool x$r_buff1_thd3; [L720] 0 _Bool x$read_delayed; [L721] 0 int *x$read_delayed_var; [L722] 0 int x$w_buff0; [L723] 0 _Bool x$w_buff0_used; [L724] 0 int x$w_buff1; [L725] 0 _Bool x$w_buff1_used; [L727] 0 int y = 0; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1906; [L821] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1907; [L823] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 1 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 0 pthread_t t1908; [L825] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L738] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L739] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L740] 1 x$flush_delayed = weak$$choice2 [L741] 1 x$mem_tmp = x [L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L742] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L743] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L745] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L747] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L748] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] 1 __unbuffered_p0_EAX = x [L750] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L750] 1 x = x$flush_delayed ? x$mem_tmp : x [L751] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 283 SDtfs, 221 SDslu, 356 SDs, 0 SdLazy, 170 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 144 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 12323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...