/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:24:53,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:24:53,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:24:53,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:24:53,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:24:53,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:24:53,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:24:53,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:24:53,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:24:54,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:24:54,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:24:54,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:24:54,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:24:54,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:24:54,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:24:54,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:24:54,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:24:54,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:24:54,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:24:54,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:24:54,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:24:54,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:24:54,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:24:54,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:24:54,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:24:54,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:24:54,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:24:54,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:24:54,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:24:54,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:24:54,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:24:54,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:24:54,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:24:54,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:24:54,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:24:54,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:24:54,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:24:54,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:24:54,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:24:54,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:24:54,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:24:54,028 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:54,057 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:24:54,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:24:54,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:24:54,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:24:54,059 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:24:54,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:24:54,059 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:24:54,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:24:54,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:24:54,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:24:54,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:24:54,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:24:54,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:24:54,060 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:24:54,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:24:54,061 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:24:54,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:24:54,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:24:54,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:24:54,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:24:54,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:24:54,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:24:54,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:24:54,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:24:54,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:24:54,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:24:54,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:24:54,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:24:54,063 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:24:54,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:24:54,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:24:54,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:24:54,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:24:54,420 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:24:54,421 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:24:54,422 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-15 18:24:54,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6999bf4a4/b6b94b79b6ec413bb23be3cbe1cc163f/FLAGc20bf0280 [2020-10-15 18:24:54,976 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:24:54,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-15 18:24:55,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6999bf4a4/b6b94b79b6ec413bb23be3cbe1cc163f/FLAGc20bf0280 [2020-10-15 18:24:55,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6999bf4a4/b6b94b79b6ec413bb23be3cbe1cc163f [2020-10-15 18:24:55,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:24:55,316 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:24:55,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:24:55,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:24:55,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:24:55,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:24:55" (1/1) ... [2020-10-15 18:24:55,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:55, skipping insertion in model container [2020-10-15 18:24:55,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:24:55" (1/1) ... [2020-10-15 18:24:55,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:24:55,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:24:55,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:24:55,998 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:24:56,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:24:56,140 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:24:56,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:56 WrapperNode [2020-10-15 18:24:56,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:24:56,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:24:56,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:24:56,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:24:56,151 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:56" (1/1) ... [2020-10-15 18:24:56,170 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:56" (1/1) ... [2020-10-15 18:24:56,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:24:56,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:24:56,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:24:56,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:24:56,228 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:56" (1/1) ... [2020-10-15 18:24:56,228 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:56" (1/1) ... [2020-10-15 18:24:56,233 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:56" (1/1) ... [2020-10-15 18:24:56,233 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:56" (1/1) ... [2020-10-15 18:24:56,244 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:56" (1/1) ... [2020-10-15 18:24:56,248 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:56" (1/1) ... [2020-10-15 18:24:56,252 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:56" (1/1) ... [2020-10-15 18:24:56,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:24:56,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:24:56,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:24:56,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:24:56,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:56" (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:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:24:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:24:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:24:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:24:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:24:56,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:24:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:24:56,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:24:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:24:56,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:24:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:24:56,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:24:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:24:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:24:56,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:24:56,341 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:58,168 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:24:58,168 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:24:58,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:24:58 BoogieIcfgContainer [2020-10-15 18:24:58,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:24:58,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:24:58,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:24:58,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:24:58,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:24:55" (1/3) ... [2020-10-15 18:24:58,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e4539f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:24:58, skipping insertion in model container [2020-10-15 18:24:58,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:24:56" (2/3) ... [2020-10-15 18:24:58,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e4539f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:24:58, skipping insertion in model container [2020-10-15 18:24:58,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:24:58" (3/3) ... [2020-10-15 18:24:58,180 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-10-15 18:24:58,191 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:24:58,192 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:24:58,200 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:24:58,201 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:24:58,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,235 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,237 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,238 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,238 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,238 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,238 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,238 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:58,239 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,239 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:58,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,239 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,240 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,241 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,251 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,251 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,252 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:58,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,252 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,252 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,253 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,253 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,255 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,256 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:24:58,273 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:24:58,295 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:24:58,296 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:24:58,296 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:24:58,296 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:24:58,296 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:24:58,296 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:24:58,296 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:24:58,296 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:24:58,311 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:24:58,314 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-15 18:24:58,318 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-15 18:24:58,320 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-15 18:24:58,371 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-15 18:24:58,372 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:24:58,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-15 18:24:58,381 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-15 18:24:58,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:58,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:58,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:58,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:58,507 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:58,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:58,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:58,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:58,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:58,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:58,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:24:58,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:24:58,550 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:58,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:58,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:24:58,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:24:58,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:58,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:58,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:58,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:58,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-15 18:24:58,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:24:58,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:24:58,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:00,054 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-15 18:25:00,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-15 18:25:00,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:00,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-15 18:25:00,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:01,314 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-15 18:25:01,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:25:01,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:01,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:01,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,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:25:01,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:01,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:01,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:01,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:01,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:01,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:01,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:01,812 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:25:02,200 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:25:02,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:02,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:02,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:25:02,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:02,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:02,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:02,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:02,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:02,500 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:25:02,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:02,502 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:25:02,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:02,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:02,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:02,506 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:25:02,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:02,508 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:25:02,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:02,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:02,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:25:02,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:02,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:03,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:03,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:25:03,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:03,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:03,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:03,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:03,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:03,069 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:25:03,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,071 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:25:03,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:03,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,075 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:25:03,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,077 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:25:03,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:03,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:25:03,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:03,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:03,666 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-15 18:25:04,118 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-15 18:25:04,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:25:04,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:25:04,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:04,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:04,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,197 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:25:04,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,199 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:25:04,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,203 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:25:04,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:25:04,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:25:04,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:25:04,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:04,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:04,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:04,323 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:25:04,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,325 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:25:04,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:04,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,329 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:25:04,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,331 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:25:04,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:04,521 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-15 18:25:04,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:25:04,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:05,879 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-15 18:25:06,198 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-15 18:25:07,172 WARN L193 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-15 18:25:07,482 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-15 18:25:07,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:25:07,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:25:07,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:25:07,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:07,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:07,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,641 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:25:07,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,643 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:25:07,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,646 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:25:07,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-15 18:25:07,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-15 18:25:07,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:07,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:07,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:07,740 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:25:07,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,742 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:25:07,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,746 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:25:07,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,747 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:25:07,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:07,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:25:07,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-15 18:25:07,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:08,771 WARN L193 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-10-15 18:25:09,146 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-15 18:25:09,488 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-15 18:25:09,613 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 18:25:09,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:09,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:09,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:09,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:09,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:09,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:09,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:09,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:09,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:09,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:25:09,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:09,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:25:09,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:25:09,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:09,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:25:09,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:25:09,764 INFO L132 LiptonReduction]: Checked pairs total: 5626 [2020-10-15 18:25:09,765 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-15 18:25:09,772 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-15 18:25:09,956 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-15 18:25:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-15 18:25:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:25:09,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:09,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:09,972 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:25:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-15 18:25:09,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:09,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967024136] [2020-10-15 18:25:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:10,314 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:25:10,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967024136] [2020-10-15 18:25:10,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:10,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:25:10,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351883795] [2020-10-15 18:25:10,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:25:10,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:25:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:10,334 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-15 18:25:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:10,462 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-15 18:25:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:25:10,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:25:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:10,503 INFO L225 Difference]: With dead ends: 2202 [2020-10-15 18:25:10,503 INFO L226 Difference]: Without dead ends: 1802 [2020-10-15 18:25:10,505 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:25:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-15 18:25:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-15 18:25:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-15 18:25:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-15 18:25:10,659 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-15 18:25:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:10,660 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-15 18:25:10,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:25:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-15 18:25:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:25:10,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:10,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:10,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:25:10,664 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:25:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 440307530, now seen corresponding path program 1 times [2020-10-15 18:25:10,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:10,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248563347] [2020-10-15 18:25:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:10,752 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:25:10,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248563347] [2020-10-15 18:25:10,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:10,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:25:10,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366141036] [2020-10-15 18:25:10,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:25:10,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:25:10,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:10,756 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-15 18:25:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:10,787 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-15 18:25:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:25:10,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:25:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:10,803 INFO L225 Difference]: With dead ends: 1762 [2020-10-15 18:25:10,803 INFO L226 Difference]: Without dead ends: 1762 [2020-10-15 18:25:10,804 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:25:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-15 18:25:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-15 18:25:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-15 18:25:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-15 18:25:10,880 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-15 18:25:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:10,881 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-15 18:25:10,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:25:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-15 18:25:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:25:10,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:10,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:10,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:25:10,889 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:25:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash 249955351, now seen corresponding path program 1 times [2020-10-15 18:25:10,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:10,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514920222] [2020-10-15 18:25:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:11,004 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:25:11,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514920222] [2020-10-15 18:25:11,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:11,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:25:11,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347008626] [2020-10-15 18:25:11,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:25:11,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:25:11,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:11,007 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-15 18:25:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:11,056 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-10-15 18:25:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:25:11,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 18:25:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:11,072 INFO L225 Difference]: With dead ends: 1754 [2020-10-15 18:25:11,073 INFO L226 Difference]: Without dead ends: 1754 [2020-10-15 18:25:11,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-10-15 18:25:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-10-15 18:25:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-10-15 18:25:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-10-15 18:25:11,144 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-10-15 18:25:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:11,145 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-10-15 18:25:11,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:25:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-10-15 18:25:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:25:11,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:11,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:11,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:25:11,148 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:25:11,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash -840938303, now seen corresponding path program 1 times [2020-10-15 18:25:11,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:11,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306521867] [2020-10-15 18:25:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:11,243 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:25:11,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306521867] [2020-10-15 18:25:11,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:11,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:25:11,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840992498] [2020-10-15 18:25:11,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:25:11,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:25:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:25:11,245 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 4 states. [2020-10-15 18:25:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:11,326 INFO L93 Difference]: Finished difference Result 1732 states and 6468 transitions. [2020-10-15 18:25:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:25:11,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 18:25:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:11,343 INFO L225 Difference]: With dead ends: 1732 [2020-10-15 18:25:11,344 INFO L226 Difference]: Without dead ends: 1732 [2020-10-15 18:25:11,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:25:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2020-10-15 18:25:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2020-10-15 18:25:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2020-10-15 18:25:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 6468 transitions. [2020-10-15 18:25:11,413 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 6468 transitions. Word has length 13 [2020-10-15 18:25:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:11,414 INFO L481 AbstractCegarLoop]: Abstraction has 1732 states and 6468 transitions. [2020-10-15 18:25:11,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:25:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 6468 transitions. [2020-10-15 18:25:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:25:11,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:11,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:11,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:25:11,416 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:25:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash -840461647, now seen corresponding path program 1 times [2020-10-15 18:25:11,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:11,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574568051] [2020-10-15 18:25:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:11,531 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:25:11,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574568051] [2020-10-15 18:25:11,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:11,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:25:11,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688296083] [2020-10-15 18:25:11,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:25:11,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:25:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:11,534 INFO L87 Difference]: Start difference. First operand 1732 states and 6468 transitions. Second operand 3 states. [2020-10-15 18:25:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:11,557 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-15 18:25:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:25:11,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 18:25:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:11,574 INFO L225 Difference]: With dead ends: 1700 [2020-10-15 18:25:11,574 INFO L226 Difference]: Without dead ends: 1700 [2020-10-15 18:25:11,574 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:25:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-15 18:25:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-15 18:25:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-15 18:25:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-15 18:25:11,646 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 13 [2020-10-15 18:25:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:11,647 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-15 18:25:11,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:25:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-15 18:25:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:25:11,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:11,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:11,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:25:11,649 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:25:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash -333997007, now seen corresponding path program 1 times [2020-10-15 18:25:11,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:11,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627509150] [2020-10-15 18:25:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:11,783 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:25:11,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627509150] [2020-10-15 18:25:11,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:11,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:25:11,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330434667] [2020-10-15 18:25:11,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:25:11,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:25:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:11,785 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 5 states. [2020-10-15 18:25:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:11,870 INFO L93 Difference]: Finished difference Result 1674 states and 6208 transitions. [2020-10-15 18:25:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:25:11,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 18:25:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:11,884 INFO L225 Difference]: With dead ends: 1674 [2020-10-15 18:25:11,884 INFO L226 Difference]: Without dead ends: 1674 [2020-10-15 18:25:11,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:25:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-10-15 18:25:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1658. [2020-10-15 18:25:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-10-15 18:25:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 6152 transitions. [2020-10-15 18:25:11,942 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 6152 transitions. Word has length 14 [2020-10-15 18:25:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:11,942 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 6152 transitions. [2020-10-15 18:25:11,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:25:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 6152 transitions. [2020-10-15 18:25:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:25:11,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:11,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:11,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:25:11,945 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:25:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash -298426553, now seen corresponding path program 1 times [2020-10-15 18:25:11,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:11,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659270644] [2020-10-15 18:25:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:12,020 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:25:12,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659270644] [2020-10-15 18:25:12,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:12,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:25:12,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296629575] [2020-10-15 18:25:12,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:25:12,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:25:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:12,022 INFO L87 Difference]: Start difference. First operand 1658 states and 6152 transitions. Second operand 5 states. [2020-10-15 18:25:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:12,074 INFO L93 Difference]: Finished difference Result 1614 states and 5960 transitions. [2020-10-15 18:25:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:25:12,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 18:25:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:12,088 INFO L225 Difference]: With dead ends: 1614 [2020-10-15 18:25:12,089 INFO L226 Difference]: Without dead ends: 1614 [2020-10-15 18:25:12,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2020-10-15 18:25:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2020-10-15 18:25:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-15 18:25:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 5960 transitions. [2020-10-15 18:25:12,140 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 5960 transitions. Word has length 14 [2020-10-15 18:25:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:12,141 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 5960 transitions. [2020-10-15 18:25:12,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:25:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 5960 transitions. [2020-10-15 18:25:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:25:12,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:12,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:12,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:25:12,144 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:25:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1763115561, now seen corresponding path program 1 times [2020-10-15 18:25:12,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:12,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40552565] [2020-10-15 18:25:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:12,258 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:25:12,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40552565] [2020-10-15 18:25:12,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:12,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:25:12,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610972368] [2020-10-15 18:25:12,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:25:12,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:25:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:25:12,261 INFO L87 Difference]: Start difference. First operand 1614 states and 5960 transitions. Second operand 6 states. [2020-10-15 18:25:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:12,348 INFO L93 Difference]: Finished difference Result 1726 states and 6416 transitions. [2020-10-15 18:25:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:25:12,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 18:25:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:12,373 INFO L225 Difference]: With dead ends: 1726 [2020-10-15 18:25:12,373 INFO L226 Difference]: Without dead ends: 1726 [2020-10-15 18:25:12,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:25:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2020-10-15 18:25:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2020-10-15 18:25:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2020-10-15 18:25:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 6416 transitions. [2020-10-15 18:25:12,430 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 6416 transitions. Word has length 15 [2020-10-15 18:25:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:12,431 INFO L481 AbstractCegarLoop]: Abstraction has 1726 states and 6416 transitions. [2020-10-15 18:25:12,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:25:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 6416 transitions. [2020-10-15 18:25:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:25:12,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:12,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:12,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:25:12,434 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:25:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1763973021, now seen corresponding path program 2 times [2020-10-15 18:25:12,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:12,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470338677] [2020-10-15 18:25:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:12,591 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:25:12,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470338677] [2020-10-15 18:25:12,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:12,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:25:12,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574171288] [2020-10-15 18:25:12,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:25:12,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:25:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:25:12,596 INFO L87 Difference]: Start difference. First operand 1726 states and 6416 transitions. Second operand 6 states. [2020-10-15 18:25:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:12,739 INFO L93 Difference]: Finished difference Result 1890 states and 6996 transitions. [2020-10-15 18:25:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:25:12,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-15 18:25:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:12,749 INFO L225 Difference]: With dead ends: 1890 [2020-10-15 18:25:12,750 INFO L226 Difference]: Without dead ends: 1890 [2020-10-15 18:25:12,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:25:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2020-10-15 18:25:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1778. [2020-10-15 18:25:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2020-10-15 18:25:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 6540 transitions. [2020-10-15 18:25:12,811 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 6540 transitions. Word has length 15 [2020-10-15 18:25:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:12,811 INFO L481 AbstractCegarLoop]: Abstraction has 1778 states and 6540 transitions. [2020-10-15 18:25:12,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:25:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 6540 transitions. [2020-10-15 18:25:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:25:12,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:12,815 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:25:12,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:25:12,816 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:25:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1177270598, now seen corresponding path program 1 times [2020-10-15 18:25:12,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:12,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610853025] [2020-10-15 18:25:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:13,023 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:25:13,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610853025] [2020-10-15 18:25:13,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:13,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:25:13,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468631074] [2020-10-15 18:25:13,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:25:13,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:25:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:25:13,028 INFO L87 Difference]: Start difference. First operand 1778 states and 6540 transitions. Second operand 7 states. [2020-10-15 18:25:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:13,191 INFO L93 Difference]: Finished difference Result 2066 states and 7644 transitions. [2020-10-15 18:25:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:25:13,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 18:25:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:13,203 INFO L225 Difference]: With dead ends: 2066 [2020-10-15 18:25:13,204 INFO L226 Difference]: Without dead ends: 2066 [2020-10-15 18:25:13,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:25:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-10-15 18:25:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1874. [2020-10-15 18:25:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1874 states. [2020-10-15 18:25:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 6940 transitions. [2020-10-15 18:25:13,279 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 6940 transitions. Word has length 16 [2020-10-15 18:25:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:13,281 INFO L481 AbstractCegarLoop]: Abstraction has 1874 states and 6940 transitions. [2020-10-15 18:25:13,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:25:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 6940 transitions. [2020-10-15 18:25:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:25:13,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:13,286 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:25:13,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:25:13,286 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:25:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 950868390, now seen corresponding path program 2 times [2020-10-15 18:25:13,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:13,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145631921] [2020-10-15 18:25:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:13,641 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:25:13,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145631921] [2020-10-15 18:25:13,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:13,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:25:13,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490650085] [2020-10-15 18:25:13,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:25:13,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:25:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:25:13,644 INFO L87 Difference]: Start difference. First operand 1874 states and 6940 transitions. Second operand 7 states. [2020-10-15 18:25:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:13,790 INFO L93 Difference]: Finished difference Result 2190 states and 7898 transitions. [2020-10-15 18:25:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:25:13,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-15 18:25:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:13,801 INFO L225 Difference]: With dead ends: 2190 [2020-10-15 18:25:13,801 INFO L226 Difference]: Without dead ends: 1902 [2020-10-15 18:25:13,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:25:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2020-10-15 18:25:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1530. [2020-10-15 18:25:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2020-10-15 18:25:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 5520 transitions. [2020-10-15 18:25:13,851 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 5520 transitions. Word has length 16 [2020-10-15 18:25:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:13,851 INFO L481 AbstractCegarLoop]: Abstraction has 1530 states and 5520 transitions. [2020-10-15 18:25:13,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:25:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 5520 transitions. [2020-10-15 18:25:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:25:13,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:13,855 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:25:13,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:25:13,855 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:25:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 974833126, now seen corresponding path program 1 times [2020-10-15 18:25:13,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:13,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527918621] [2020-10-15 18:25:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:13,902 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:25:13,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527918621] [2020-10-15 18:25:13,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:13,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:25:13,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189888778] [2020-10-15 18:25:13,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:25:13,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:13,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:25:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:25:13,904 INFO L87 Difference]: Start difference. First operand 1530 states and 5520 transitions. Second operand 4 states. [2020-10-15 18:25:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:13,938 INFO L93 Difference]: Finished difference Result 1618 states and 5330 transitions. [2020-10-15 18:25:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:25:13,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:25:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:13,944 INFO L225 Difference]: With dead ends: 1618 [2020-10-15 18:25:13,944 INFO L226 Difference]: Without dead ends: 1218 [2020-10-15 18:25:13,944 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:25:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-10-15 18:25:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2020-10-15 18:25:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-10-15 18:25:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3978 transitions. [2020-10-15 18:25:13,977 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3978 transitions. Word has length 16 [2020-10-15 18:25:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:13,977 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 3978 transitions. [2020-10-15 18:25:13,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:25:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3978 transitions. [2020-10-15 18:25:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:25:13,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:13,980 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:25:13,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:25:13,981 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:25:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:13,981 INFO L82 PathProgramCache]: Analyzing trace with hash -350364005, now seen corresponding path program 1 times [2020-10-15 18:25:13,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:13,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822554941] [2020-10-15 18:25:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,034 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:25:14,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822554941] [2020-10-15 18:25:14,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:25:14,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617464735] [2020-10-15 18:25:14,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:25:14,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:25:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:14,036 INFO L87 Difference]: Start difference. First operand 1218 states and 3978 transitions. Second operand 5 states. [2020-10-15 18:25:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,104 INFO L93 Difference]: Finished difference Result 1085 states and 3261 transitions. [2020-10-15 18:25:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:25:14,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:25:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,108 INFO L225 Difference]: With dead ends: 1085 [2020-10-15 18:25:14,108 INFO L226 Difference]: Without dead ends: 829 [2020-10-15 18:25:14,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:25:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2020-10-15 18:25:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2020-10-15 18:25:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2020-10-15 18:25:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2452 transitions. [2020-10-15 18:25:14,129 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2452 transitions. Word has length 17 [2020-10-15 18:25:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,129 INFO L481 AbstractCegarLoop]: Abstraction has 829 states and 2452 transitions. [2020-10-15 18:25:14,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:25:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2452 transitions. [2020-10-15 18:25:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:25:14,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:14,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:25:14,132 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:25:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1278143232, now seen corresponding path program 1 times [2020-10-15 18:25:14,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989820291] [2020-10-15 18:25:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,187 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:25:14,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989820291] [2020-10-15 18:25:14,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:25:14,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333212954] [2020-10-15 18:25:14,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:25:14,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:25:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:14,189 INFO L87 Difference]: Start difference. First operand 829 states and 2452 transitions. Second operand 5 states. [2020-10-15 18:25:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,263 INFO L93 Difference]: Finished difference Result 1211 states and 3510 transitions. [2020-10-15 18:25:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:25:14,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-15 18:25:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,268 INFO L225 Difference]: With dead ends: 1211 [2020-10-15 18:25:14,268 INFO L226 Difference]: Without dead ends: 877 [2020-10-15 18:25:14,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2020-10-15 18:25:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2020-10-15 18:25:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2020-10-15 18:25:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2544 transitions. [2020-10-15 18:25:14,294 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 2544 transitions. Word has length 18 [2020-10-15 18:25:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,295 INFO L481 AbstractCegarLoop]: Abstraction has 877 states and 2544 transitions. [2020-10-15 18:25:14,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:25:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 2544 transitions. [2020-10-15 18:25:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:25:14,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:25:14,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:25:14,298 INFO L429 AbstractCegarLoop]: === Iteration 15 === [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:25:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1336874896, now seen corresponding path program 2 times [2020-10-15 18:25:14,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270863699] [2020-10-15 18:25:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,364 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:25:14,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270863699] [2020-10-15 18:25:14,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:25:14,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595687270] [2020-10-15 18:25:14,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:25:14,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:25:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:14,366 INFO L87 Difference]: Start difference. First operand 877 states and 2544 transitions. Second operand 5 states. [2020-10-15 18:25:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,458 INFO L93 Difference]: Finished difference Result 1109 states and 3131 transitions. [2020-10-15 18:25:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:25:14,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-15 18:25:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,461 INFO L225 Difference]: With dead ends: 1109 [2020-10-15 18:25:14,462 INFO L226 Difference]: Without dead ends: 887 [2020-10-15 18:25:14,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:25:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-15 18:25:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 823. [2020-10-15 18:25:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2020-10-15 18:25:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 2301 transitions. [2020-10-15 18:25:14,482 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 2301 transitions. Word has length 18 [2020-10-15 18:25:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,483 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 2301 transitions. [2020-10-15 18:25:14,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:25:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 2301 transitions. [2020-10-15 18:25:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:25:14,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,485 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:25:14,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:25:14,486 INFO L429 AbstractCegarLoop]: === Iteration 16 === [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:25:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 125424893, now seen corresponding path program 1 times [2020-10-15 18:25:14,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376617252] [2020-10-15 18:25:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,524 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:25:14,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376617252] [2020-10-15 18:25:14,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:25:14,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238377315] [2020-10-15 18:25:14,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:25:14,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:25:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:25:14,526 INFO L87 Difference]: Start difference. First operand 823 states and 2301 transitions. Second operand 4 states. [2020-10-15 18:25:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,549 INFO L93 Difference]: Finished difference Result 1115 states and 3040 transitions. [2020-10-15 18:25:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:25:14,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-15 18:25:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,552 INFO L225 Difference]: With dead ends: 1115 [2020-10-15 18:25:14,552 INFO L226 Difference]: Without dead ends: 513 [2020-10-15 18:25:14,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:25:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-15 18:25:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-15 18:25:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-15 18:25:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1303 transitions. [2020-10-15 18:25:14,566 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1303 transitions. Word has length 19 [2020-10-15 18:25:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,567 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1303 transitions. [2020-10-15 18:25:14,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:25:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1303 transitions. [2020-10-15 18:25:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:25:14,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,568 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:25:14,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:25:14,569 INFO L429 AbstractCegarLoop]: === Iteration 17 === [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:25:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash -900066335, now seen corresponding path program 2 times [2020-10-15 18:25:14,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798994172] [2020-10-15 18:25:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,603 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:25:14,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798994172] [2020-10-15 18:25:14,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:25:14,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184600786] [2020-10-15 18:25:14,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:25:14,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:25:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:14,605 INFO L87 Difference]: Start difference. First operand 513 states and 1303 transitions. Second operand 3 states. [2020-10-15 18:25:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,615 INFO L93 Difference]: Finished difference Result 687 states and 1688 transitions. [2020-10-15 18:25:14,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:25:14,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-15 18:25:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,618 INFO L225 Difference]: With dead ends: 687 [2020-10-15 18:25:14,618 INFO L226 Difference]: Without dead ends: 517 [2020-10-15 18:25:14,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:25:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-15 18:25:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 503. [2020-10-15 18:25:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-10-15 18:25:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1209 transitions. [2020-10-15 18:25:14,628 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1209 transitions. Word has length 19 [2020-10-15 18:25:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,628 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 1209 transitions. [2020-10-15 18:25:14,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:25:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1209 transitions. [2020-10-15 18:25:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:25:14,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,630 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:25:14,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:25:14,630 INFO L429 AbstractCegarLoop]: === Iteration 18 === [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:25:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2026188855, now seen corresponding path program 1 times [2020-10-15 18:25:14,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544103120] [2020-10-15 18:25:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,685 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:25:14,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544103120] [2020-10-15 18:25:14,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:25:14,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917815721] [2020-10-15 18:25:14,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:25:14,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:25:14,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:25:14,687 INFO L87 Difference]: Start difference. First operand 503 states and 1209 transitions. Second operand 6 states. [2020-10-15 18:25:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,751 INFO L93 Difference]: Finished difference Result 432 states and 991 transitions. [2020-10-15 18:25:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:25:14,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 18:25:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,753 INFO L225 Difference]: With dead ends: 432 [2020-10-15 18:25:14,753 INFO L226 Difference]: Without dead ends: 296 [2020-10-15 18:25:14,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:25:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-10-15 18:25:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2020-10-15 18:25:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-15 18:25:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-10-15 18:25:14,759 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 19 [2020-10-15 18:25:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,759 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-10-15 18:25:14,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:25:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-10-15 18:25:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:25:14,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,761 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:25:14,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:25:14,761 INFO L429 AbstractCegarLoop]: === Iteration 19 === [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:25:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1225847851, now seen corresponding path program 1 times [2020-10-15 18:25:14,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129887491] [2020-10-15 18:25:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:25:14,830 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:25:14,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129887491] [2020-10-15 18:25:14,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:25:14,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:25:14,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297678365] [2020-10-15 18:25:14,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:25:14,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:25:14,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:25:14,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:25:14,832 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 7 states. [2020-10-15 18:25:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:25:14,925 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-10-15 18:25:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:25:14,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 18:25:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:25:14,926 INFO L225 Difference]: With dead ends: 276 [2020-10-15 18:25:14,927 INFO L226 Difference]: Without dead ends: 63 [2020-10-15 18:25:14,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:25:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-15 18:25:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-15 18:25:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-15 18:25:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-10-15 18:25:14,929 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-10-15 18:25:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:25:14,930 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-10-15 18:25:14,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:25:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-10-15 18:25:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-15 18:25:14,930 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:25:14,930 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] [2020-10-15 18:25:14,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:25:14,931 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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:25:14,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:25:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash 358783119, now seen corresponding path program 1 times [2020-10-15 18:25:14,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:25:14,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647142486] [2020-10-15 18:25:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:25:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:25:14,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:25:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:25:14,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:25:15,029 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:25:15,029 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:25:15,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:25:15,031 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:25:15,044 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse6 (= (mod ~z$w_buff0_used~0_In707798204 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In707798204 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In707798204 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In707798204 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out707798204 ~z$w_buff1_used~0_In707798204)) (and (= ~z$w_buff1_used~0_Out707798204 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= ~z$w_buff0_used~0_Out707798204 0)) (and .cse5 (= ~z$w_buff0_used~0_Out707798204 ~z$w_buff0_used~0_In707798204))) (or (and (or (and .cse0 (= ~z~0_In707798204 ~z~0_Out707798204)) (and .cse1 (= ~z$w_buff1~0_In707798204 ~z~0_Out707798204) .cse2)) .cse5) (and .cse3 (= ~z$w_buff0~0_In707798204 ~z~0_Out707798204) .cse4)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In707798204 0)) (= ~z$r_buff1_thd0~0_Out707798204 ~z$r_buff1_thd0~0_In707798204) (= ~z$r_buff0_thd0~0_In707798204 ~z$r_buff0_thd0~0_Out707798204)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In707798204, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In707798204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In707798204, ~z$w_buff0~0=~z$w_buff0~0_In707798204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In707798204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In707798204, ~z$w_buff1~0=~z$w_buff1~0_In707798204, ~z~0=~z~0_In707798204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out707798204, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out707798204|, ~z$w_buff0~0=~z$w_buff0~0_In707798204, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out707798204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out707798204, ~z$w_buff1~0=~z$w_buff1~0_In707798204, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out707798204|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out707798204|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out707798204|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out707798204|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out707798204, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In707798204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out707798204, ~z~0=~z~0_Out707798204} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-15 18:25:15,050 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:25:15,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,052 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:25:15,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,053 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:25:15,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,053 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:25:15,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,053 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:25:15,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,054 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:25:15,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,055 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:25:15,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,055 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:25:15,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,055 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:25:15,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,056 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:25:15,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,056 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:25:15,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,056 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:25:15,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,057 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:25:15,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,057 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:25:15,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,058 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:25:15,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,058 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:25:15,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,058 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:25:15,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,059 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:25:15,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,059 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:25:15,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,060 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:25:15,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,060 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:25:15,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,060 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:25:15,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,061 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:25:15,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,061 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:25:15,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,061 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:25:15,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:25:15,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:25:15 BasicIcfg [2020-10-15 18:25:15,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:25:15,136 INFO L168 Benchmark]: Toolchain (without parser) took 19820.36 ms. Allocated memory was 250.1 MB in the beginning and 615.0 MB in the end (delta: 364.9 MB). Free memory was 205.0 MB in the beginning and 213.9 MB in the end (delta: -8.9 MB). Peak memory consumption was 356.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:25:15,136 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:25:15,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.27 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 205.0 MB in the beginning and 256.1 MB in the end (delta: -51.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:25:15,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.27 ms. Allocated memory is still 310.4 MB. Free memory was 256.1 MB in the beginning and 253.6 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:25:15,138 INFO L168 Benchmark]: Boogie Preprocessor took 43.41 ms. Allocated memory is still 310.4 MB. Free memory was 253.6 MB in the beginning and 251.1 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:25:15,139 INFO L168 Benchmark]: RCFGBuilder took 1909.70 ms. Allocated memory was 310.4 MB in the beginning and 356.5 MB in the end (delta: 46.1 MB). Free memory was 251.1 MB in the beginning and 201.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 95.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:25:15,139 INFO L168 Benchmark]: TraceAbstraction took 16962.35 ms. Allocated memory was 356.5 MB in the beginning and 615.0 MB in the end (delta: 258.5 MB). Free memory was 201.7 MB in the beginning and 213.9 MB in the end (delta: -12.2 MB). Peak memory consumption was 246.3 MB. Max. memory is 14.2 GB. [2020-10-15 18:25:15,142 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 823.27 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 205.0 MB in the beginning and 256.1 MB in the end (delta: -51.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.27 ms. Allocated memory is still 310.4 MB. Free memory was 256.1 MB in the beginning and 253.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.41 ms. Allocated memory is still 310.4 MB. Free memory was 253.6 MB in the beginning and 251.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1909.70 ms. Allocated memory was 310.4 MB in the beginning and 356.5 MB in the end (delta: 46.1 MB). Free memory was 251.1 MB in the beginning and 201.7 MB in the end (delta: 49.4 MB). Peak memory consumption was 95.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 16962.35 ms. Allocated memory was 356.5 MB in the beginning and 615.0 MB in the end (delta: 258.5 MB). Free memory was 201.7 MB in the beginning and 213.9 MB in the end (delta: -12.2 MB). Peak memory consumption was 246.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1636 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 69 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 186 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.4s, 118 PlacesBefore, 44 PlacesAfterwards, 107 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 5626 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_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1525; [L824] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L825] 0 pthread_t t1526; [L826] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L827] 0 pthread_t t1527; [L828] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L829] 0 pthread_t t1528; [L830] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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] [L735] 1 a = 1 VAL [__unbuffered_cnt=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] [L738] 1 x = 1 VAL [__unbuffered_cnt=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] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L750] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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] [L753] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=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] [L765] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L768] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L771] 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) [L771] 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) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 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 [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 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 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L801] 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) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] 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) [L801] 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) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 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 [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 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 [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=0, weak$$choice2=0, x=2, y=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] 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) [L847] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [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_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 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)) [L852] EXPR 0 !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) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] 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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 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_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=255, x=2, y=2, 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, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 543 SDtfs, 868 SDslu, 753 SDs, 0 SdLazy, 343 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 770 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 23968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...