/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/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:24:21,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:24:21,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:24:21,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:24:21,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:24:21,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:24:21,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:24:21,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:24:21,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:24:21,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:24:21,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:24:21,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:24:21,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:24:21,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:24:21,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:24:21,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:24:21,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:24:21,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:24:21,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:24:21,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:24:21,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:24:21,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:24:21,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:24:21,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:24:21,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:24:21,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:24:21,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:24:21,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:24:21,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:24:21,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:24:21,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:24:21,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:24:21,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:24:21,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:24:21,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:24:21,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:24:21,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:24:21,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:24:21,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:24:21,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:24:21,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:24:21,901 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-15 18:24:21,933 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:24:21,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:24:21,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:24:21,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:24:21,935 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:24:21,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:24:21,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:24:21,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:24:21,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:24:21,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:24:21,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:24:21,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:24:21,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:24:21,936 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:24:21,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:24:21,937 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:24:21,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:24:21,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:24:21,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:24:21,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:24:21,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:24:21,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:24:21,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:24:21,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:24:21,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:24:21,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:24:21,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:24:21,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:24:21,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:24:21,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:24:22,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:24:22,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:24:22,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:24:22,279 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:24:22,279 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:24:22,280 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-15 18:24:22,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a26a6544/97bfa24ad1174ec1b2158f06dd02c19e/FLAGe35402a85 [2020-10-15 18:24:22,879 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:24:22,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-15 18:24:22,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a26a6544/97bfa24ad1174ec1b2158f06dd02c19e/FLAGe35402a85 [2020-10-15 18:24:23,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a26a6544/97bfa24ad1174ec1b2158f06dd02c19e [2020-10-15 18:24:23,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:24:23,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:24:23,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:24:23,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:24:23,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:24:23,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:24:23" (1/1) ... [2020-10-15 18:24:23,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c441a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:23, skipping insertion in model container [2020-10-15 18:24:23,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:24:23" (1/1) ... [2020-10-15 18:24:23,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:24:23,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:24:23,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:24:23,835 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:24:23,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:24:24,012 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:24:24,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24 WrapperNode [2020-10-15 18:24:24,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:24:24,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:24:24,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:24:24,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:24:24,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:24:24,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:24:24,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:24:24,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:24:24,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (1/1) ... [2020-10-15 18:24:24,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:24:24,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:24:24,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:24:24,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:24:24,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (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-15 18:24:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:24:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:24:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:24:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:24:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:24:24,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:24:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:24:24,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:24:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:24:24,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:24:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:24:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:24:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:24:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:24:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:24:24,199 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:24:26,117 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:24:26,118 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:24:26,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:24:26 BoogieIcfgContainer [2020-10-15 18:24:26,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:24:26,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:24:26,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:24:26,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:24:26,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:24:23" (1/3) ... [2020-10-15 18:24:26,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28fd0a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:24:26, skipping insertion in model container [2020-10-15 18:24:26,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:24" (2/3) ... [2020-10-15 18:24:26,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28fd0a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:24:26, skipping insertion in model container [2020-10-15 18:24:26,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:24:26" (3/3) ... [2020-10-15 18:24:26,129 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2020-10-15 18:24:26,141 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:24:26,141 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:24:26,149 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:24:26,150 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:24:26,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,188 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,190 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,191 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,203 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,205 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,206 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:26,226 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:24:26,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:24:26,247 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:24:26,247 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:24:26,247 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:24:26,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:24:26,248 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:24:26,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:24:26,248 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:24:26,263 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:24:26,266 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-15 18:24:26,269 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-15 18:24:26,271 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-15 18:24:26,325 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-15 18:24:26,325 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:24:26,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-15 18:24:26,338 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-15 18:24:26,650 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:24:26,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:26,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:26,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:26,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:26,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:26,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:26,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:26,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:24:26,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:26,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:26,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:26,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:26,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:26,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:26,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:26,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:26,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:26,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:27,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:27,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:27,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:27,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:27,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:27,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:27,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:27,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 18:24:27,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:27,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:27,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:27,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:27,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:27,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:27,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:27,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:27,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:28,366 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-15 18:24:28,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-15 18:24:28,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:28,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:28,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,217 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-15 18:24:29,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:29,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:29,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-15 18:24:29,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:29,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:29,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:29,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:29,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:29,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:29,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:29,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:29,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:29,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:29,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:24:29,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-15 18:24:29,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:30,275 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-15 18:24:30,391 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:24:30,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:24:30,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:30,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:30,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:30,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:24:30,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:30,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:30,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:30,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:30,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:30,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:30,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:30,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:30,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:31,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:24:31,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:31,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:24:31,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:31,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:24:31,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:31,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:31,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:31,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:24:31,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:31,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:24:31,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:32,332 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-15 18:24:32,461 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-15 18:24:32,470 INFO L132 LiptonReduction]: Checked pairs total: 6555 [2020-10-15 18:24:32,470 INFO L134 LiptonReduction]: Total number of compositions: 89 [2020-10-15 18:24:32,476 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 18:24:32,692 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-10-15 18:24:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-10-15 18:24:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:24:32,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:32,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:32,709 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2065333905, now seen corresponding path program 1 times [2020-10-15 18:24:32,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:32,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567751087] [2020-10-15 18:24:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:33,046 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-15 18:24:33,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567751087] [2020-10-15 18:24:33,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:33,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:24:33,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649540136] [2020-10-15 18:24:33,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:24:33,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:33,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:24:33,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:24:33,073 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-10-15 18:24:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:33,222 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-15 18:24:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:24:33,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:24:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:33,282 INFO L225 Difference]: With dead ends: 2602 [2020-10-15 18:24:33,282 INFO L226 Difference]: Without dead ends: 2202 [2020-10-15 18:24:33,284 INFO L677 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-15 18:24:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-10-15 18:24:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-10-15 18:24:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 18:24:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-10-15 18:24:33,523 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-10-15 18:24:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:33,524 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-10-15 18:24:33,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:24:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-10-15 18:24:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:24:33,528 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:33,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:33,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:24:33,529 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1342131682, now seen corresponding path program 1 times [2020-10-15 18:24:33,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:33,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099565405] [2020-10-15 18:24:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:33,693 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-15 18:24:33,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099565405] [2020-10-15 18:24:33,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:33,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:24:33,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853130730] [2020-10-15 18:24:33,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:24:33,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:33,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:24:33,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:24:33,698 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-10-15 18:24:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:33,761 INFO L93 Difference]: Finished difference Result 2502 states and 9254 transitions. [2020-10-15 18:24:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:33,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 18:24:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:33,780 INFO L225 Difference]: With dead ends: 2502 [2020-10-15 18:24:33,780 INFO L226 Difference]: Without dead ends: 2102 [2020-10-15 18:24:33,781 INFO L677 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-15 18:24:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-10-15 18:24:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102. [2020-10-15 18:24:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-10-15 18:24:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions. [2020-10-15 18:24:33,871 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12 [2020-10-15 18:24:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:33,871 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions. [2020-10-15 18:24:33,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:24:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions. [2020-10-15 18:24:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:24:33,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:33,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:33,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:24:33,881 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1343575012, now seen corresponding path program 1 times [2020-10-15 18:24:33,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:33,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393840175] [2020-10-15 18:24:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:34,052 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-15 18:24:34,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393840175] [2020-10-15 18:24:34,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:34,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:24:34,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853988748] [2020-10-15 18:24:34,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:24:34,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:24:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:24:34,055 INFO L87 Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 4 states. [2020-10-15 18:24:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:34,131 INFO L93 Difference]: Finished difference Result 2396 states and 8804 transitions. [2020-10-15 18:24:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:34,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 18:24:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:34,149 INFO L225 Difference]: With dead ends: 2396 [2020-10-15 18:24:34,150 INFO L226 Difference]: Without dead ends: 2046 [2020-10-15 18:24:34,150 INFO L677 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-15 18:24:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2020-10-15 18:24:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2020-10-15 18:24:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2020-10-15 18:24:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 7716 transitions. [2020-10-15 18:24:34,235 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 7716 transitions. Word has length 13 [2020-10-15 18:24:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:34,235 INFO L481 AbstractCegarLoop]: Abstraction has 2046 states and 7716 transitions. [2020-10-15 18:24:34,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:24:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 7716 transitions. [2020-10-15 18:24:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:24:34,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:34,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:34,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:24:34,239 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash -701214973, now seen corresponding path program 1 times [2020-10-15 18:24:34,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:34,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840674531] [2020-10-15 18:24:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:34,386 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-15 18:24:34,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840674531] [2020-10-15 18:24:34,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:34,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:24:34,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110829587] [2020-10-15 18:24:34,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:24:34,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:24:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:34,389 INFO L87 Difference]: Start difference. First operand 2046 states and 7716 transitions. Second operand 6 states. [2020-10-15 18:24:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:34,546 INFO L93 Difference]: Finished difference Result 2214 states and 8110 transitions. [2020-10-15 18:24:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:34,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 18:24:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:34,564 INFO L225 Difference]: With dead ends: 2214 [2020-10-15 18:24:34,564 INFO L226 Difference]: Without dead ends: 1934 [2020-10-15 18:24:34,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:24:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2020-10-15 18:24:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2020-10-15 18:24:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-10-15 18:24:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 7220 transitions. [2020-10-15 18:24:34,634 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 7220 transitions. Word has length 14 [2020-10-15 18:24:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:34,635 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 7220 transitions. [2020-10-15 18:24:34,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:24:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 7220 transitions. [2020-10-15 18:24:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:24:34,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:34,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:34,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:24:34,638 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1610053253, now seen corresponding path program 1 times [2020-10-15 18:24:34,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:34,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303640994] [2020-10-15 18:24:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:34,714 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-15 18:24:34,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303640994] [2020-10-15 18:24:34,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:34,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:34,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100329336] [2020-10-15 18:24:34,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:34,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:34,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:34,717 INFO L87 Difference]: Start difference. First operand 1934 states and 7220 transitions. Second operand 5 states. [2020-10-15 18:24:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:34,823 INFO L93 Difference]: Finished difference Result 2160 states and 7898 transitions. [2020-10-15 18:24:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:34,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:24:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:34,839 INFO L225 Difference]: With dead ends: 2160 [2020-10-15 18:24:34,839 INFO L226 Difference]: Without dead ends: 1950 [2020-10-15 18:24:34,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-15 18:24:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2020-10-15 18:24:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1950. [2020-10-15 18:24:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2020-10-15 18:24:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 7276 transitions. [2020-10-15 18:24:34,909 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 7276 transitions. Word has length 15 [2020-10-15 18:24:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:34,909 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 7276 transitions. [2020-10-15 18:24:34,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 7276 transitions. [2020-10-15 18:24:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:24:34,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:34,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:34,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:24:34,913 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1351736453, now seen corresponding path program 2 times [2020-10-15 18:24:34,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:34,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701633910] [2020-10-15 18:24:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:35,036 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-15 18:24:35,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701633910] [2020-10-15 18:24:35,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:35,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:24:35,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689093203] [2020-10-15 18:24:35,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:24:35,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:24:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:35,039 INFO L87 Difference]: Start difference. First operand 1950 states and 7276 transitions. Second operand 6 states. [2020-10-15 18:24:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:35,224 INFO L93 Difference]: Finished difference Result 2076 states and 7582 transitions. [2020-10-15 18:24:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:35,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 18:24:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:35,245 INFO L225 Difference]: With dead ends: 2076 [2020-10-15 18:24:35,245 INFO L226 Difference]: Without dead ends: 1866 [2020-10-15 18:24:35,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:24:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2020-10-15 18:24:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1850. [2020-10-15 18:24:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2020-10-15 18:24:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 6876 transitions. [2020-10-15 18:24:35,300 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 6876 transitions. Word has length 15 [2020-10-15 18:24:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:35,301 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 6876 transitions. [2020-10-15 18:24:35,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:24:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 6876 transitions. [2020-10-15 18:24:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:24:35,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:35,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:35,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:24:35,305 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 666758434, now seen corresponding path program 1 times [2020-10-15 18:24:35,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:35,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178867265] [2020-10-15 18:24:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:35,387 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-15 18:24:35,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178867265] [2020-10-15 18:24:35,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:35,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:24:35,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539978562] [2020-10-15 18:24:35,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:24:35,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:24:35,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:24:35,389 INFO L87 Difference]: Start difference. First operand 1850 states and 6876 transitions. Second operand 4 states. [2020-10-15 18:24:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:35,433 INFO L93 Difference]: Finished difference Result 1850 states and 6260 transitions. [2020-10-15 18:24:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:35,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:24:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:35,444 INFO L225 Difference]: With dead ends: 1850 [2020-10-15 18:24:35,444 INFO L226 Difference]: Without dead ends: 1450 [2020-10-15 18:24:35,445 INFO L677 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-15 18:24:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-15 18:24:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-15 18:24:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-15 18:24:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 4876 transitions. [2020-10-15 18:24:35,484 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 4876 transitions. Word has length 16 [2020-10-15 18:24:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:35,485 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 4876 transitions. [2020-10-15 18:24:35,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:24:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 4876 transitions. [2020-10-15 18:24:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:24:35,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:35,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:35,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:24:35,488 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:35,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1803367302, now seen corresponding path program 1 times [2020-10-15 18:24:35,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:35,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195288152] [2020-10-15 18:24:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:35,572 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-15 18:24:35,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195288152] [2020-10-15 18:24:35,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:35,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:24:35,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178918583] [2020-10-15 18:24:35,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:35,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:35,574 INFO L87 Difference]: Start difference. First operand 1450 states and 4876 transitions. Second operand 5 states. [2020-10-15 18:24:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:35,626 INFO L93 Difference]: Finished difference Result 1176 states and 3588 transitions. [2020-10-15 18:24:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:35,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:24:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:35,634 INFO L225 Difference]: With dead ends: 1176 [2020-10-15 18:24:35,634 INFO L226 Difference]: Without dead ends: 920 [2020-10-15 18:24:35,635 INFO L677 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-15 18:24:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-10-15 18:24:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2020-10-15 18:24:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-10-15 18:24:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2756 transitions. [2020-10-15 18:24:35,658 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2756 transitions. Word has length 17 [2020-10-15 18:24:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:35,659 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 2756 transitions. [2020-10-15 18:24:35,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2756 transitions. [2020-10-15 18:24:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:35,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:35,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:35,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:24:35,662 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash 690303399, now seen corresponding path program 1 times [2020-10-15 18:24:35,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:35,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208492387] [2020-10-15 18:24:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:35,727 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-15 18:24:35,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208492387] [2020-10-15 18:24:35,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:35,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:24:35,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626301501] [2020-10-15 18:24:35,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:24:35,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:24:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:24:35,730 INFO L87 Difference]: Start difference. First operand 920 states and 2756 transitions. Second operand 5 states. [2020-10-15 18:24:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:35,770 INFO L93 Difference]: Finished difference Result 1313 states and 3829 transitions. [2020-10-15 18:24:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:24:35,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-15 18:24:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:35,775 INFO L225 Difference]: With dead ends: 1313 [2020-10-15 18:24:35,776 INFO L226 Difference]: Without dead ends: 968 [2020-10-15 18:24:35,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-10-15 18:24:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 920. [2020-10-15 18:24:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-10-15 18:24:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2676 transitions. [2020-10-15 18:24:35,799 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2676 transitions. Word has length 19 [2020-10-15 18:24:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:35,799 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 2676 transitions. [2020-10-15 18:24:35,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:24:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2676 transitions. [2020-10-15 18:24:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:35,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:35,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:35,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:24:35,802 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1923521869, now seen corresponding path program 2 times [2020-10-15 18:24:35,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:35,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553352599] [2020-10-15 18:24:35,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:35,885 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-15 18:24:35,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553352599] [2020-10-15 18:24:35,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:35,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:24:35,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979263858] [2020-10-15 18:24:35,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:24:35,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:24:35,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:35,888 INFO L87 Difference]: Start difference. First operand 920 states and 2676 transitions. Second operand 6 states. [2020-10-15 18:24:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:35,951 INFO L93 Difference]: Finished difference Result 1350 states and 3753 transitions. [2020-10-15 18:24:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:35,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:24:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:35,955 INFO L225 Difference]: With dead ends: 1350 [2020-10-15 18:24:35,956 INFO L226 Difference]: Without dead ends: 942 [2020-10-15 18:24:35,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:24:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2020-10-15 18:24:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 902. [2020-10-15 18:24:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2020-10-15 18:24:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2491 transitions. [2020-10-15 18:24:35,979 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 2491 transitions. Word has length 19 [2020-10-15 18:24:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:35,980 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 2491 transitions. [2020-10-15 18:24:35,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:24:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 2491 transitions. [2020-10-15 18:24:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:24:35,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:35,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:35,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:24:35,983 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -217914650, now seen corresponding path program 1 times [2020-10-15 18:24:35,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:35,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296116485] [2020-10-15 18:24:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:36,066 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-15 18:24:36,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296116485] [2020-10-15 18:24:36,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:36,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:24:36,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896697152] [2020-10-15 18:24:36,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:24:36,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:24:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:24:36,068 INFO L87 Difference]: Start difference. First operand 902 states and 2491 transitions. Second operand 6 states. [2020-10-15 18:24:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:36,129 INFO L93 Difference]: Finished difference Result 746 states and 2009 transitions. [2020-10-15 18:24:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:24:36,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:24:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:36,133 INFO L225 Difference]: With dead ends: 746 [2020-10-15 18:24:36,133 INFO L226 Difference]: Without dead ends: 592 [2020-10-15 18:24:36,133 INFO L677 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-15 18:24:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-10-15 18:24:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2020-10-15 18:24:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-10-15 18:24:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1566 transitions. [2020-10-15 18:24:36,148 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1566 transitions. Word has length 19 [2020-10-15 18:24:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:36,149 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 1566 transitions. [2020-10-15 18:24:36,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:24:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1566 transitions. [2020-10-15 18:24:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:24:36,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:36,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:36,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:24:36,152 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2147199299, now seen corresponding path program 1 times [2020-10-15 18:24:36,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:36,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055381733] [2020-10-15 18:24:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:36,261 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-15 18:24:36,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055381733] [2020-10-15 18:24:36,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:36,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:24:36,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888051831] [2020-10-15 18:24:36,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:24:36,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:36,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:24:36,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:24:36,263 INFO L87 Difference]: Start difference. First operand 592 states and 1566 transitions. Second operand 7 states. [2020-10-15 18:24:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:36,342 INFO L93 Difference]: Finished difference Result 555 states and 1492 transitions. [2020-10-15 18:24:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:24:36,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 18:24:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:36,344 INFO L225 Difference]: With dead ends: 555 [2020-10-15 18:24:36,344 INFO L226 Difference]: Without dead ends: 180 [2020-10-15 18:24:36,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:24:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-15 18:24:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2020-10-15 18:24:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-15 18:24:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 446 transitions. [2020-10-15 18:24:36,349 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 446 transitions. Word has length 22 [2020-10-15 18:24:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:36,349 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 446 transitions. [2020-10-15 18:24:36,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:24:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 446 transitions. [2020-10-15 18:24:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:24:36,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:36,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:36,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:24:36,351 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:36,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:36,352 INFO L82 PathProgramCache]: Analyzing trace with hash -250477544, now seen corresponding path program 1 times [2020-10-15 18:24:36,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:36,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135870468] [2020-10-15 18:24:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:24:36,618 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-15 18:24:36,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135870468] [2020-10-15 18:24:36,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:24:36,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:24:36,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458817702] [2020-10-15 18:24:36,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:24:36,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:24:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:24:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:24:36,620 INFO L87 Difference]: Start difference. First operand 180 states and 446 transitions. Second operand 9 states. [2020-10-15 18:24:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:24:36,755 INFO L93 Difference]: Finished difference Result 243 states and 591 transitions. [2020-10-15 18:24:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:24:36,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-15 18:24:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:24:36,756 INFO L225 Difference]: With dead ends: 243 [2020-10-15 18:24:36,756 INFO L226 Difference]: Without dead ends: 140 [2020-10-15 18:24:36,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:24:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-15 18:24:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-10-15 18:24:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-15 18:24:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 318 transitions. [2020-10-15 18:24:36,761 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 318 transitions. Word has length 26 [2020-10-15 18:24:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:24:36,762 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 318 transitions. [2020-10-15 18:24:36,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:24:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 318 transitions. [2020-10-15 18:24:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:24:36,763 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:24:36,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:24:36,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:24:36,764 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:24:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:24:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash -694662336, now seen corresponding path program 2 times [2020-10-15 18:24:36,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:24:36,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135717289] [2020-10-15 18:24:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:24:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:24:36,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:24:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:24:36,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:24:36,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:24:36,873 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:24:36,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:24:36,898 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-15 18:24:36,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,901 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-15 18:24:36,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,901 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-15 18:24:36,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,902 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-15 18:24:36,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,902 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-15 18:24:36,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,903 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-15 18:24:36,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,903 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-15 18:24:36,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,904 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-15 18:24:36,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,904 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-15 18:24:36,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,905 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-15 18:24:36,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,905 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-15 18:24:36,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,906 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-15 18:24:36,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,907 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-15 18:24:36,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,907 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-15 18:24:36,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,907 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-15 18:24:36,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,908 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-15 18:24:36,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,908 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-15 18:24:36,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,909 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-15 18:24:36,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,909 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-15 18:24:36,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,910 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-15 18:24:36,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,910 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-15 18:24:36,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,911 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-15 18:24:36,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,911 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-15 18:24:36,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,911 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-15 18:24:36,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,912 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-15 18:24:36,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,912 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-15 18:24:36,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,913 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-15 18:24:36,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,913 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-15 18:24:36,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:36,914 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-15 18:24:36,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:24:37,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:24:37 BasicIcfg [2020-10-15 18:24:37,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:24:37,016 INFO L168 Benchmark]: Toolchain (without parser) took 13848.90 ms. Allocated memory was 252.7 MB in the beginning and 562.0 MB in the end (delta: 309.3 MB). Free memory was 208.0 MB in the beginning and 154.0 MB in the end (delta: 54.0 MB). Peak memory consumption was 363.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:37,017 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:24:37,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.44 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 208.0 MB in the beginning and 265.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:37,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.63 ms. Allocated memory is still 317.7 MB. Free memory was 265.8 MB in the beginning and 263.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:37,020 INFO L168 Benchmark]: Boogie Preprocessor took 51.92 ms. Allocated memory is still 317.7 MB. Free memory was 263.3 MB in the beginning and 260.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:37,023 INFO L168 Benchmark]: RCFGBuilder took 1982.96 ms. Allocated memory was 317.7 MB in the beginning and 360.7 MB in the end (delta: 43.0 MB). Free memory was 260.8 MB in the beginning and 207.5 MB in the end (delta: 53.3 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:37,024 INFO L168 Benchmark]: TraceAbstraction took 10890.66 ms. Allocated memory was 360.7 MB in the beginning and 562.0 MB in the end (delta: 201.3 MB). Free memory was 207.5 MB in the beginning and 154.0 MB in the end (delta: 53.5 MB). Peak memory consumption was 254.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:24:37,027 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.26 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 844.44 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 208.0 MB in the beginning and 265.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.63 ms. Allocated memory is still 317.7 MB. Free memory was 265.8 MB in the beginning and 263.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 51.92 ms. Allocated memory is still 317.7 MB. Free memory was 263.3 MB in the beginning and 260.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1982.96 ms. Allocated memory was 317.7 MB in the beginning and 360.7 MB in the end (delta: 43.0 MB). Free memory was 260.8 MB in the beginning and 207.5 MB in the end (delta: 53.3 MB). Peak memory consumption was 97.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10890.66 ms. Allocated memory was 360.7 MB in the beginning and 562.0 MB in the end (delta: 201.3 MB). Free memory was 207.5 MB in the beginning and 154.0 MB in the end (delta: 53.5 MB). Peak memory consumption was 254.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1465 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 154 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 119 PlacesBefore, 45 PlacesAfterwards, 108 TransitionsBefore, 33 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 6555 MoverChecksTotal - CounterExampleResult [Line: 7]: 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_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1477; [L826] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1478; [L828] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1479; [L830] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1480; [L832] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L838] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L841] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L841] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 492 SDtfs, 599 SDslu, 1036 SDs, 0 SdLazy, 368 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 22137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...