/usr/bin/java -Xmx8000000000 -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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:30:32,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:30:32,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:30:32,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:30:32,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:30:32,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:30:32,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:30:32,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:30:32,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:30:32,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:30:32,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:30:32,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:30:32,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:30:32,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:30:32,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:30:32,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:30:32,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:30:32,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:30:32,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:30:32,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:30:32,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:30:32,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:30:32,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:30:32,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:30:32,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:30:32,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:30:32,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:30:32,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:30:32,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:30:32,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:30:32,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:30:32,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:30:32,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:30:32,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:30:32,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:30:32,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:30:32,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:30:32,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:30:32,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:30:32,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:30:32,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:30:32,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:30:32,282 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:30:32,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:30:32,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:30:32,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:30:32,284 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:30:32,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:30:32,284 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:30:32,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:30:32,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:30:32,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:30:32,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:30:32,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:30:32,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:30:32,286 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:30:32,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:30:32,286 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:30:32,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:30:32,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:30:32,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:30:32,287 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:30:32,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:30:32,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:30:32,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:30:32,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:30:32,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:30:32,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:30:32,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:30:32,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:30:32,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:30:32,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:30:32,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:30:32,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:30:32,624 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:30:32,624 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:30:32,625 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2020-10-05 23:30:32,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ae81e84/88e151cd3eef4cc19d5226ceec59b4a2/FLAGe1dcb3abc [2020-10-05 23:30:33,264 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:30:33,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2020-10-05 23:30:33,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ae81e84/88e151cd3eef4cc19d5226ceec59b4a2/FLAGe1dcb3abc [2020-10-05 23:30:33,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ae81e84/88e151cd3eef4cc19d5226ceec59b4a2 [2020-10-05 23:30:33,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:30:33,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:30:33,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:30:33,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:30:33,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:30:33,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:30:33" (1/1) ... [2020-10-05 23:30:33,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aefb380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:33, skipping insertion in model container [2020-10-05 23:30:33,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:30:33" (1/1) ... [2020-10-05 23:30:33,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:30:33,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:30:34,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:30:34,292 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:30:34,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:30:34,438 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:30:34,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34 WrapperNode [2020-10-05 23:30:34,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:30:34,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:30:34,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:30:34,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:30:34,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:30:34,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:30:34,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:30:34,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:30:34,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (1/1) ... [2020-10-05 23:30:34,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:30:34,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:30:34,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:30:34,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:30:34,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (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-05 23:30:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:30:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:30:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:30:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:30:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:30:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:30:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:30:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:30:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:30:34,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:30:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:30:34,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:30:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:30:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:30:34,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:30:34,653 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:30:36,881 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:30:36,881 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:30:36,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:30:36 BoogieIcfgContainer [2020-10-05 23:30:36,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:30:36,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:30:36,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:30:36,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:30:36,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:30:33" (1/3) ... [2020-10-05 23:30:36,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec3a4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:30:36, skipping insertion in model container [2020-10-05 23:30:36,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:34" (2/3) ... [2020-10-05 23:30:36,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec3a4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:30:36, skipping insertion in model container [2020-10-05 23:30:36,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:30:36" (3/3) ... [2020-10-05 23:30:36,899 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2020-10-05 23:30:36,911 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:30:36,911 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:30:36,923 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:30:36,924 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:30:36,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,970 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,970 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,977 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,978 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,993 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,997 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,997 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,998 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:36,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:37,014 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:30:37,036 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:30:37,037 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:30:37,037 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:30:37,037 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:30:37,037 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:30:37,037 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:30:37,037 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:30:37,038 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:30:37,055 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-05 23:30:37,057 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-05 23:30:37,112 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-05 23:30:37,112 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:30:37,118 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 23:30:37,123 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-05 23:30:37,151 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-05 23:30:37,151 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:30:37,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 23:30:37,156 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2572 [2020-10-05 23:30:37,157 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:30:37,774 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:30:39,149 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-05 23:30:39,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-05 23:30:39,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:30:39,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 23:30:39,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:30:40,500 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-05 23:30:41,352 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:30:42,476 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-05 23:30:42,787 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-05 23:30:43,153 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:30:43,283 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:30:44,938 WARN L193 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-05 23:30:45,478 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-05 23:30:45,799 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-05 23:30:45,998 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-05 23:30:46,006 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7529 [2020-10-05 23:30:46,006 INFO L214 etLargeBlockEncoding]: Total number of compositions: 88 [2020-10-05 23:30:46,010 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-05 23:30:46,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-05 23:30:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-05 23:30:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:30:46,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:46,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:46,327 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:46,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash -836286608, now seen corresponding path program 1 times [2020-10-05 23:30:46,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:46,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952743825] [2020-10-05 23:30:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:30:46,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952743825] [2020-10-05 23:30:46,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:46,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:46,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884745489] [2020-10-05 23:30:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:46,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:46,720 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-05 23:30:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:46,860 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-05 23:30:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:46,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:30:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:46,907 INFO L225 Difference]: With dead ends: 3250 [2020-10-05 23:30:46,907 INFO L226 Difference]: Without dead ends: 2650 [2020-10-05 23:30:46,908 INFO L675 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-05 23:30:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-05 23:30:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-05 23:30:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-05 23:30:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-05 23:30:47,105 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-05 23:30:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:47,106 INFO L479 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-05 23:30:47,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-05 23:30:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:30:47,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:47,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:47,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:30:47,111 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1410706723, now seen corresponding path program 1 times [2020-10-05 23:30:47,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:47,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037025873] [2020-10-05 23:30:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:47,197 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-05 23:30:47,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037025873] [2020-10-05 23:30:47,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:47,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:47,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881349293] [2020-10-05 23:30:47,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:47,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:47,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:47,201 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-05 23:30:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:47,237 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-05 23:30:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:47,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:30:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:47,260 INFO L225 Difference]: With dead ends: 2450 [2020-10-05 23:30:47,261 INFO L226 Difference]: Without dead ends: 2450 [2020-10-05 23:30:47,261 INFO L675 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-05 23:30:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-05 23:30:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-05 23:30:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-05 23:30:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-05 23:30:47,362 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 11 [2020-10-05 23:30:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:47,362 INFO L479 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-05 23:30:47,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-05 23:30:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:30:47,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:47,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:47,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:30:47,367 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1541590479, now seen corresponding path program 1 times [2020-10-05 23:30:47,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:47,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894040692] [2020-10-05 23:30:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:47,453 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-05 23:30:47,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894040692] [2020-10-05 23:30:47,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:47,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949608738] [2020-10-05 23:30:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:47,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:47,456 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-05 23:30:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:47,573 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-10-05 23:30:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:47,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:30:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:47,595 INFO L225 Difference]: With dead ends: 2442 [2020-10-05 23:30:47,596 INFO L226 Difference]: Without dead ends: 2442 [2020-10-05 23:30:47,602 INFO L675 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-05 23:30:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-05 23:30:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-05 23:30:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-05 23:30:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-10-05 23:30:47,706 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 13 [2020-10-05 23:30:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:47,706 INFO L479 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-10-05 23:30:47,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-10-05 23:30:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:30:47,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:47,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:47,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:30:47,711 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1895245069, now seen corresponding path program 1 times [2020-10-05 23:30:47,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:47,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320523259] [2020-10-05 23:30:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:47,868 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-05 23:30:47,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320523259] [2020-10-05 23:30:47,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:47,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:47,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460051162] [2020-10-05 23:30:47,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:47,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:47,871 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 3 states. [2020-10-05 23:30:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:47,946 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-10-05 23:30:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:47,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-05 23:30:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:47,968 INFO L225 Difference]: With dead ends: 2418 [2020-10-05 23:30:47,968 INFO L226 Difference]: Without dead ends: 2418 [2020-10-05 23:30:47,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-10-05 23:30:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-10-05 23:30:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-10-05 23:30:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-10-05 23:30:48,053 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-10-05 23:30:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:48,053 INFO L479 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-10-05 23:30:48,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-10-05 23:30:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:30:48,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:48,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:48,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:30:48,057 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -337746026, now seen corresponding path program 1 times [2020-10-05 23:30:48,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:48,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674015476] [2020-10-05 23:30:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:48,162 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-05 23:30:48,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674015476] [2020-10-05 23:30:48,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:48,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:48,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481100137] [2020-10-05 23:30:48,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:48,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:48,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:48,164 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 5 states. [2020-10-05 23:30:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:48,256 INFO L93 Difference]: Finished difference Result 2410 states and 9174 transitions. [2020-10-05 23:30:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:48,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:30:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:48,287 INFO L225 Difference]: With dead ends: 2410 [2020-10-05 23:30:48,288 INFO L226 Difference]: Without dead ends: 2410 [2020-10-05 23:30:48,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-05 23:30:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-05 23:30:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-05 23:30:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9174 transitions. [2020-10-05 23:30:48,379 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9174 transitions. Word has length 14 [2020-10-05 23:30:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:48,380 INFO L479 AbstractCegarLoop]: Abstraction has 2410 states and 9174 transitions. [2020-10-05 23:30:48,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9174 transitions. [2020-10-05 23:30:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:30:48,384 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:48,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:48,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:30:48,384 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash -31126931, now seen corresponding path program 1 times [2020-10-05 23:30:48,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:48,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277580560] [2020-10-05 23:30:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:48,526 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-05 23:30:48,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277580560] [2020-10-05 23:30:48,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:48,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:48,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839946092] [2020-10-05 23:30:48,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:48,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:48,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:48,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:48,531 INFO L87 Difference]: Start difference. First operand 2410 states and 9174 transitions. Second operand 5 states. [2020-10-05 23:30:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:48,671 INFO L93 Difference]: Finished difference Result 2402 states and 9128 transitions. [2020-10-05 23:30:48,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:48,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:30:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:48,702 INFO L225 Difference]: With dead ends: 2402 [2020-10-05 23:30:48,702 INFO L226 Difference]: Without dead ends: 2402 [2020-10-05 23:30:48,703 INFO L675 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-05 23:30:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-10-05 23:30:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2362. [2020-10-05 23:30:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2020-10-05 23:30:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8974 transitions. [2020-10-05 23:30:48,850 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8974 transitions. Word has length 15 [2020-10-05 23:30:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:48,851 INFO L479 AbstractCegarLoop]: Abstraction has 2362 states and 8974 transitions. [2020-10-05 23:30:48,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8974 transitions. [2020-10-05 23:30:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:30:48,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:48,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:48,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:30:48,855 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1170026438, now seen corresponding path program 1 times [2020-10-05 23:30:48,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:48,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65668762] [2020-10-05 23:30:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:48,949 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-05 23:30:48,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65668762] [2020-10-05 23:30:48,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:48,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:48,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461921209] [2020-10-05 23:30:48,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:48,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:48,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:48,952 INFO L87 Difference]: Start difference. First operand 2362 states and 8974 transitions. Second operand 5 states. [2020-10-05 23:30:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:49,056 INFO L93 Difference]: Finished difference Result 2434 states and 9238 transitions. [2020-10-05 23:30:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:49,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:30:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:49,073 INFO L225 Difference]: With dead ends: 2434 [2020-10-05 23:30:49,073 INFO L226 Difference]: Without dead ends: 2434 [2020-10-05 23:30:49,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2020-10-05 23:30:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2020-10-05 23:30:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-10-05 23:30:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9238 transitions. [2020-10-05 23:30:49,167 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9238 transitions. Word has length 15 [2020-10-05 23:30:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:49,167 INFO L479 AbstractCegarLoop]: Abstraction has 2434 states and 9238 transitions. [2020-10-05 23:30:49,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9238 transitions. [2020-10-05 23:30:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:49,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:49,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:49,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:30:49,173 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash -758016294, now seen corresponding path program 1 times [2020-10-05 23:30:49,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:49,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317535037] [2020-10-05 23:30:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:49,336 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-05 23:30:49,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317535037] [2020-10-05 23:30:49,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:49,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:49,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866721434] [2020-10-05 23:30:49,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:49,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:49,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:49,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:49,342 INFO L87 Difference]: Start difference. First operand 2434 states and 9238 transitions. Second operand 5 states. [2020-10-05 23:30:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:49,487 INFO L93 Difference]: Finished difference Result 2634 states and 10064 transitions. [2020-10-05 23:30:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:49,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:30:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:49,508 INFO L225 Difference]: With dead ends: 2634 [2020-10-05 23:30:49,508 INFO L226 Difference]: Without dead ends: 2634 [2020-10-05 23:30:49,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-05 23:30:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2020-10-05 23:30:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2020-10-05 23:30:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2020-10-05 23:30:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 10064 transitions. [2020-10-05 23:30:49,640 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 10064 transitions. Word has length 16 [2020-10-05 23:30:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:49,640 INFO L479 AbstractCegarLoop]: Abstraction has 2634 states and 10064 transitions. [2020-10-05 23:30:49,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 10064 transitions. [2020-10-05 23:30:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:49,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:49,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:49,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:30:49,647 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:49,647 INFO L82 PathProgramCache]: Analyzing trace with hash -964935120, now seen corresponding path program 2 times [2020-10-05 23:30:49,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:49,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364066007] [2020-10-05 23:30:49,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:49,785 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-05 23:30:49,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364066007] [2020-10-05 23:30:49,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:49,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:49,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455473046] [2020-10-05 23:30:49,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:49,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:49,788 INFO L87 Difference]: Start difference. First operand 2634 states and 10064 transitions. Second operand 6 states. [2020-10-05 23:30:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:49,964 INFO L93 Difference]: Finished difference Result 2994 states and 11386 transitions. [2020-10-05 23:30:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:49,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:30:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:49,978 INFO L225 Difference]: With dead ends: 2994 [2020-10-05 23:30:49,979 INFO L226 Difference]: Without dead ends: 2994 [2020-10-05 23:30:49,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-10-05 23:30:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2786. [2020-10-05 23:30:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2020-10-05 23:30:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 10534 transitions. [2020-10-05 23:30:50,067 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 10534 transitions. Word has length 16 [2020-10-05 23:30:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:50,068 INFO L479 AbstractCegarLoop]: Abstraction has 2786 states and 10534 transitions. [2020-10-05 23:30:50,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 10534 transitions. [2020-10-05 23:30:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:50,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:50,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:50,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:30:50,074 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1782844021, now seen corresponding path program 1 times [2020-10-05 23:30:50,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:50,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167926788] [2020-10-05 23:30:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:50,219 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-05 23:30:50,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167926788] [2020-10-05 23:30:50,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:50,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:50,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063892993] [2020-10-05 23:30:50,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:50,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:50,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:50,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:50,222 INFO L87 Difference]: Start difference. First operand 2786 states and 10534 transitions. Second operand 6 states. [2020-10-05 23:30:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:50,401 INFO L93 Difference]: Finished difference Result 2778 states and 10498 transitions. [2020-10-05 23:30:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:50,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:30:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:50,415 INFO L225 Difference]: With dead ends: 2778 [2020-10-05 23:30:50,415 INFO L226 Difference]: Without dead ends: 2778 [2020-10-05 23:30:50,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2020-10-05 23:30:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2020-10-05 23:30:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2020-10-05 23:30:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 10498 transitions. [2020-10-05 23:30:50,516 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 10498 transitions. Word has length 16 [2020-10-05 23:30:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:50,517 INFO L479 AbstractCegarLoop]: Abstraction has 2778 states and 10498 transitions. [2020-10-05 23:30:50,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 10498 transitions. [2020-10-05 23:30:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:50,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:50,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:50,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:30:50,525 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:50,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1843516725, now seen corresponding path program 1 times [2020-10-05 23:30:50,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:50,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594011830] [2020-10-05 23:30:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:50,606 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-05 23:30:50,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594011830] [2020-10-05 23:30:50,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:50,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:50,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719135511] [2020-10-05 23:30:50,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:50,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:50,608 INFO L87 Difference]: Start difference. First operand 2778 states and 10498 transitions. Second operand 7 states. [2020-10-05 23:30:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:50,860 INFO L93 Difference]: Finished difference Result 4266 states and 16041 transitions. [2020-10-05 23:30:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:30:50,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:30:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:50,873 INFO L225 Difference]: With dead ends: 4266 [2020-10-05 23:30:50,873 INFO L226 Difference]: Without dead ends: 2898 [2020-10-05 23:30:50,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:30:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-10-05 23:30:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2562. [2020-10-05 23:30:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-10-05 23:30:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 9232 transitions. [2020-10-05 23:30:50,955 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 9232 transitions. Word has length 16 [2020-10-05 23:30:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:50,956 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 9232 transitions. [2020-10-05 23:30:50,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 9232 transitions. [2020-10-05 23:30:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:50,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:50,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:50,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:30:50,962 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash 569457625, now seen corresponding path program 2 times [2020-10-05 23:30:50,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:50,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622621984] [2020-10-05 23:30:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:50,999 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-05 23:30:50,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622621984] [2020-10-05 23:30:51,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:51,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:51,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658379754] [2020-10-05 23:30:51,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:51,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:51,002 INFO L87 Difference]: Start difference. First operand 2562 states and 9232 transitions. Second operand 3 states. [2020-10-05 23:30:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:51,037 INFO L93 Difference]: Finished difference Result 2546 states and 9164 transitions. [2020-10-05 23:30:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:51,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-05 23:30:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:51,051 INFO L225 Difference]: With dead ends: 2546 [2020-10-05 23:30:51,051 INFO L226 Difference]: Without dead ends: 2546 [2020-10-05 23:30:51,052 INFO L675 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-05 23:30:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2020-10-05 23:30:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2020-10-05 23:30:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2020-10-05 23:30:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9164 transitions. [2020-10-05 23:30:51,138 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9164 transitions. Word has length 16 [2020-10-05 23:30:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:51,138 INFO L479 AbstractCegarLoop]: Abstraction has 2546 states and 9164 transitions. [2020-10-05 23:30:51,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9164 transitions. [2020-10-05 23:30:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:30:51,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:51,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:51,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:30:51,145 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash -262450869, now seen corresponding path program 1 times [2020-10-05 23:30:51,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:51,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20265708] [2020-10-05 23:30:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:51,398 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-05 23:30:51,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20265708] [2020-10-05 23:30:51,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:51,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:51,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299495795] [2020-10-05 23:30:51,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:51,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:51,402 INFO L87 Difference]: Start difference. First operand 2546 states and 9164 transitions. Second operand 7 states. [2020-10-05 23:30:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:51,540 INFO L93 Difference]: Finished difference Result 2994 states and 10712 transitions. [2020-10-05 23:30:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:51,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-05 23:30:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:51,551 INFO L225 Difference]: With dead ends: 2994 [2020-10-05 23:30:51,551 INFO L226 Difference]: Without dead ends: 2914 [2020-10-05 23:30:51,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-10-05 23:30:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2690. [2020-10-05 23:30:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2020-10-05 23:30:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 9700 transitions. [2020-10-05 23:30:51,694 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 9700 transitions. Word has length 17 [2020-10-05 23:30:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:51,695 INFO L479 AbstractCegarLoop]: Abstraction has 2690 states and 9700 transitions. [2020-10-05 23:30:51,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 9700 transitions. [2020-10-05 23:30:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:30:51,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:51,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:51,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:30:51,701 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 151780047, now seen corresponding path program 2 times [2020-10-05 23:30:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:51,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941904107] [2020-10-05 23:30:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:51,954 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-05 23:30:51,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941904107] [2020-10-05 23:30:51,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:51,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:51,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542299847] [2020-10-05 23:30:51,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:51,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:51,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:51,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:51,956 INFO L87 Difference]: Start difference. First operand 2690 states and 9700 transitions. Second operand 7 states. [2020-10-05 23:30:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:52,188 INFO L93 Difference]: Finished difference Result 2714 states and 9698 transitions. [2020-10-05 23:30:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:52,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-05 23:30:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:52,196 INFO L225 Difference]: With dead ends: 2714 [2020-10-05 23:30:52,196 INFO L226 Difference]: Without dead ends: 2498 [2020-10-05 23:30:52,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:30:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2020-10-05 23:30:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2146. [2020-10-05 23:30:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2020-10-05 23:30:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 7740 transitions. [2020-10-05 23:30:52,256 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 7740 transitions. Word has length 17 [2020-10-05 23:30:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:52,257 INFO L479 AbstractCegarLoop]: Abstraction has 2146 states and 7740 transitions. [2020-10-05 23:30:52,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 7740 transitions. [2020-10-05 23:30:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:30:52,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:52,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:52,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:30:52,261 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash 825285145, now seen corresponding path program 1 times [2020-10-05 23:30:52,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:52,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633426664] [2020-10-05 23:30:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:52,383 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-05 23:30:52,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633426664] [2020-10-05 23:30:52,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:52,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:52,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294362341] [2020-10-05 23:30:52,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:52,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:52,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:52,385 INFO L87 Difference]: Start difference. First operand 2146 states and 7740 transitions. Second operand 6 states. [2020-10-05 23:30:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:52,487 INFO L93 Difference]: Finished difference Result 2282 states and 8252 transitions. [2020-10-05 23:30:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:52,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:30:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:52,497 INFO L225 Difference]: With dead ends: 2282 [2020-10-05 23:30:52,497 INFO L226 Difference]: Without dead ends: 2282 [2020-10-05 23:30:52,497 INFO L675 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-05 23:30:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-10-05 23:30:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2170. [2020-10-05 23:30:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-05 23:30:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7804 transitions. [2020-10-05 23:30:52,554 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7804 transitions. Word has length 17 [2020-10-05 23:30:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:52,554 INFO L479 AbstractCegarLoop]: Abstraction has 2170 states and 7804 transitions. [2020-10-05 23:30:52,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7804 transitions. [2020-10-05 23:30:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:30:52,558 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:52,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:52,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:30:52,559 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:52,559 INFO L82 PathProgramCache]: Analyzing trace with hash -388101251, now seen corresponding path program 1 times [2020-10-05 23:30:52,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:52,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46546955] [2020-10-05 23:30:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:52,616 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-05 23:30:52,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46546955] [2020-10-05 23:30:52,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:52,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:52,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614002645] [2020-10-05 23:30:52,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:52,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:52,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:52,618 INFO L87 Difference]: Start difference. First operand 2170 states and 7804 transitions. Second operand 4 states. [2020-10-05 23:30:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:52,675 INFO L93 Difference]: Finished difference Result 2236 states and 7326 transitions. [2020-10-05 23:30:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:52,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-05 23:30:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:52,680 INFO L225 Difference]: With dead ends: 2236 [2020-10-05 23:30:52,680 INFO L226 Difference]: Without dead ends: 1660 [2020-10-05 23:30:52,681 INFO L675 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-05 23:30:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2020-10-05 23:30:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2020-10-05 23:30:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2020-10-05 23:30:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 5380 transitions. [2020-10-05 23:30:52,719 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 5380 transitions. Word has length 17 [2020-10-05 23:30:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:52,720 INFO L479 AbstractCegarLoop]: Abstraction has 1660 states and 5380 transitions. [2020-10-05 23:30:52,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 5380 transitions. [2020-10-05 23:30:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:30:52,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:52,723 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-05 23:30:52,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:30:52,724 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -283043781, now seen corresponding path program 1 times [2020-10-05 23:30:52,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:52,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385109492] [2020-10-05 23:30:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:52,780 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-05 23:30:52,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385109492] [2020-10-05 23:30:52,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:52,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:52,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477082235] [2020-10-05 23:30:52,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:52,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:52,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:52,783 INFO L87 Difference]: Start difference. First operand 1660 states and 5380 transitions. Second operand 5 states. [2020-10-05 23:30:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:52,843 INFO L93 Difference]: Finished difference Result 1445 states and 4330 transitions. [2020-10-05 23:30:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:52,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-05 23:30:52,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:52,847 INFO L225 Difference]: With dead ends: 1445 [2020-10-05 23:30:52,847 INFO L226 Difference]: Without dead ends: 1103 [2020-10-05 23:30:52,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-10-05 23:30:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-10-05 23:30:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-10-05 23:30:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3254 transitions. [2020-10-05 23:30:52,870 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 3254 transitions. Word has length 18 [2020-10-05 23:30:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:52,870 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 3254 transitions. [2020-10-05 23:30:52,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 3254 transitions. [2020-10-05 23:30:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:30:52,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:52,873 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] [2020-10-05 23:30:52,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:30:52,873 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1193922686, now seen corresponding path program 1 times [2020-10-05 23:30:52,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:52,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701494219] [2020-10-05 23:30:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:52,924 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-05 23:30:52,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701494219] [2020-10-05 23:30:52,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:52,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:52,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725162080] [2020-10-05 23:30:52,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:52,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:52,926 INFO L87 Difference]: Start difference. First operand 1103 states and 3254 transitions. Second operand 5 states. [2020-10-05 23:30:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:53,012 INFO L93 Difference]: Finished difference Result 1653 states and 4764 transitions. [2020-10-05 23:30:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:53,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-05 23:30:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:53,015 INFO L225 Difference]: With dead ends: 1653 [2020-10-05 23:30:53,016 INFO L226 Difference]: Without dead ends: 1187 [2020-10-05 23:30:53,016 INFO L675 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-05 23:30:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-10-05 23:30:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1175. [2020-10-05 23:30:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2020-10-05 23:30:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 3441 transitions. [2020-10-05 23:30:53,037 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 3441 transitions. Word has length 20 [2020-10-05 23:30:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:53,037 INFO L479 AbstractCegarLoop]: Abstraction has 1175 states and 3441 transitions. [2020-10-05 23:30:53,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 3441 transitions. [2020-10-05 23:30:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:30:53,040 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:53,040 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] [2020-10-05 23:30:53,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:30:53,040 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1794674588, now seen corresponding path program 2 times [2020-10-05 23:30:53,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:53,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530938965] [2020-10-05 23:30:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:53,081 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-05 23:30:53,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530938965] [2020-10-05 23:30:53,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:53,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:30:53,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217649451] [2020-10-05 23:30:53,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:53,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:53,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:53,084 INFO L87 Difference]: Start difference. First operand 1175 states and 3441 transitions. Second operand 3 states. [2020-10-05 23:30:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:53,100 INFO L93 Difference]: Finished difference Result 1583 states and 4510 transitions. [2020-10-05 23:30:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:53,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-05 23:30:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:53,104 INFO L225 Difference]: With dead ends: 1583 [2020-10-05 23:30:53,104 INFO L226 Difference]: Without dead ends: 1189 [2020-10-05 23:30:53,104 INFO L675 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-05 23:30:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-10-05 23:30:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1089. [2020-10-05 23:30:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2020-10-05 23:30:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 3029 transitions. [2020-10-05 23:30:53,168 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 3029 transitions. Word has length 20 [2020-10-05 23:30:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:53,168 INFO L479 AbstractCegarLoop]: Abstraction has 1089 states and 3029 transitions. [2020-10-05 23:30:53,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 3029 transitions. [2020-10-05 23:30:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:30:53,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:53,171 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] [2020-10-05 23:30:53,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:30:53,171 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash 453402744, now seen corresponding path program 1 times [2020-10-05 23:30:53,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:53,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538552535] [2020-10-05 23:30:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:53,251 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-05 23:30:53,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538552535] [2020-10-05 23:30:53,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:53,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:53,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771372863] [2020-10-05 23:30:53,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:53,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:53,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:53,253 INFO L87 Difference]: Start difference. First operand 1089 states and 3029 transitions. Second operand 6 states. [2020-10-05 23:30:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:53,315 INFO L93 Difference]: Finished difference Result 968 states and 2655 transitions. [2020-10-05 23:30:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:30:53,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:30:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:53,317 INFO L225 Difference]: With dead ends: 968 [2020-10-05 23:30:53,317 INFO L226 Difference]: Without dead ends: 799 [2020-10-05 23:30:53,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:53,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2020-10-05 23:30:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 791. [2020-10-05 23:30:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-10-05 23:30:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2195 transitions. [2020-10-05 23:30:53,333 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 2195 transitions. Word has length 21 [2020-10-05 23:30:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:53,334 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 2195 transitions. [2020-10-05 23:30:53,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 2195 transitions. [2020-10-05 23:30:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:30:53,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:53,336 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] [2020-10-05 23:30:53,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:30:53,336 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -655976501, now seen corresponding path program 1 times [2020-10-05 23:30:53,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:53,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470000592] [2020-10-05 23:30:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:53,382 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-05 23:30:53,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470000592] [2020-10-05 23:30:53,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:53,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:53,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674778383] [2020-10-05 23:30:53,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:53,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:53,384 INFO L87 Difference]: Start difference. First operand 791 states and 2195 transitions. Second operand 4 states. [2020-10-05 23:30:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:53,404 INFO L93 Difference]: Finished difference Result 997 states and 2670 transitions. [2020-10-05 23:30:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:53,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-05 23:30:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:53,407 INFO L225 Difference]: With dead ends: 997 [2020-10-05 23:30:53,407 INFO L226 Difference]: Without dead ends: 658 [2020-10-05 23:30:53,407 INFO L675 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-05 23:30:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2020-10-05 23:30:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 655. [2020-10-05 23:30:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2020-10-05 23:30:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1680 transitions. [2020-10-05 23:30:53,420 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1680 transitions. Word has length 24 [2020-10-05 23:30:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:53,420 INFO L479 AbstractCegarLoop]: Abstraction has 655 states and 1680 transitions. [2020-10-05 23:30:53,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1680 transitions. [2020-10-05 23:30:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:30:53,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:53,422 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] [2020-10-05 23:30:53,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:30:53,422 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -168689361, now seen corresponding path program 1 times [2020-10-05 23:30:53,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:53,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091905019] [2020-10-05 23:30:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:53,500 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-05 23:30:53,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091905019] [2020-10-05 23:30:53,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:53,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:30:53,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950210682] [2020-10-05 23:30:53,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:53,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:53,502 INFO L87 Difference]: Start difference. First operand 655 states and 1680 transitions. Second operand 7 states. [2020-10-05 23:30:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:53,598 INFO L93 Difference]: Finished difference Result 629 states and 1629 transitions. [2020-10-05 23:30:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:30:53,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 23:30:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:53,600 INFO L225 Difference]: With dead ends: 629 [2020-10-05 23:30:53,600 INFO L226 Difference]: Without dead ends: 138 [2020-10-05 23:30:53,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-05 23:30:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-05 23:30:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-05 23:30:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions. [2020-10-05 23:30:53,605 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 24 [2020-10-05 23:30:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:53,605 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 323 transitions. [2020-10-05 23:30:53,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions. [2020-10-05 23:30:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 23:30:53,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:53,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:53,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:30:53,607 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash 114942006, now seen corresponding path program 1 times [2020-10-05 23:30:53,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:53,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970166479] [2020-10-05 23:30:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:53,877 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-05 23:30:53,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970166479] [2020-10-05 23:30:53,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:53,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:53,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650059162] [2020-10-05 23:30:53,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:53,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:53,880 INFO L87 Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 6 states. [2020-10-05 23:30:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:54,057 INFO L93 Difference]: Finished difference Result 188 states and 441 transitions. [2020-10-05 23:30:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:54,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-05 23:30:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:54,059 INFO L225 Difference]: With dead ends: 188 [2020-10-05 23:30:54,059 INFO L226 Difference]: Without dead ends: 138 [2020-10-05 23:30:54,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-05 23:30:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2020-10-05 23:30:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-05 23:30:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 243 transitions. [2020-10-05 23:30:54,062 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 243 transitions. Word has length 27 [2020-10-05 23:30:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:54,063 INFO L479 AbstractCegarLoop]: Abstraction has 114 states and 243 transitions. [2020-10-05 23:30:54,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 243 transitions. [2020-10-05 23:30:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 23:30:54,063 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:54,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:54,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:30:54,064 INFO L427 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1014745852, now seen corresponding path program 2 times [2020-10-05 23:30:54,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:54,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983537638] [2020-10-05 23:30:54,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:30:54,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:30:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:30:54,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:30:54,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:30:54,180 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:30:54,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:30:54,181 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:30:54,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-1859413847 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1859413847 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-1859413847 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-1859413847 256) 0))) (let ((.cse1 (or .cse9 .cse8)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse0 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff0_thd0~0_Out-1859413847 ~y$r_buff0_thd0~0_In-1859413847) (= ~y$r_buff1_thd0~0_In-1859413847 ~y$r_buff1_thd0~0_Out-1859413847) (or (and .cse0 (or (and (= ~y~0_Out-1859413847 ~y~0_In-1859413847) .cse1) (and (= ~y$w_buff1~0_In-1859413847 ~y~0_Out-1859413847) .cse2 .cse3))) (and (= ~y~0_Out-1859413847 ~y$w_buff0~0_In-1859413847) .cse4 .cse5)) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-1859413847)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1859413847| ULTIMATE.start_assume_abort_if_not_~cond_Out-1859413847) (or (and .cse1 (= ~y$w_buff1_used~0_Out-1859413847 ~y$w_buff1_used~0_In-1859413847)) (and (= ~y$w_buff1_used~0_Out-1859413847 0) .cse2 .cse3)) (or (and .cse0 (= ~y$w_buff0_used~0_Out-1859413847 ~y$w_buff0_used~0_In-1859413847)) (and (= ~y$w_buff0_used~0_Out-1859413847 0) .cse4 .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1859413847|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1859413847, ~y$w_buff1~0=~y$w_buff1~0_In-1859413847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1859413847, ~y$w_buff0~0=~y$w_buff0~0_In-1859413847, ~y~0=~y~0_In-1859413847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1859413847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1859413847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1859413847, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1859413847|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1859413847|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1859413847|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1859413847|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1859413847|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1859413847|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1859413847|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1859413847, ~y$w_buff1~0=~y$w_buff1~0_In-1859413847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1859413847, ~y$w_buff0~0=~y$w_buff0~0_In-1859413847, ~y~0=~y~0_Out-1859413847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1859413847, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1859413847} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:30:54,203 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-05 23:30:54,203 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,205 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-05 23:30:54,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,206 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-05 23:30:54,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,206 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-05 23:30:54,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,206 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-05 23:30:54,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,207 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-05 23:30:54,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,207 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-05 23:30:54,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,208 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-05 23:30:54,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,208 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-05 23:30:54,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,209 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-05 23:30:54,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,209 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-05 23:30:54,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,209 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-05 23:30:54,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,210 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-05 23:30:54,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,211 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-05 23:30:54,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,211 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-05 23:30:54,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,211 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-05 23:30:54,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,212 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-05 23:30:54,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,213 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-05 23:30:54,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,213 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-05 23:30:54,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,213 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-05 23:30:54,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,214 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-05 23:30:54,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,214 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-05 23:30:54,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,214 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-05 23:30:54,215 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,215 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-05 23:30:54,215 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,215 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-05 23:30:54,215 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,215 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-05 23:30:54,216 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,216 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-05 23:30:54,216 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,216 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-05 23:30:54,216 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:54,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:30:54 BasicIcfg [2020-10-05 23:30:54,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:30:54,295 INFO L168 Benchmark]: Toolchain (without parser) took 20682.72 ms. Allocated memory was 147.3 MB in the beginning and 473.4 MB in the end (delta: 326.1 MB). Free memory was 102.0 MB in the beginning and 199.2 MB in the end (delta: -97.3 MB). Peak memory consumption was 228.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,298 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.03 ms. Allocated memory was 147.3 MB in the beginning and 203.4 MB in the end (delta: 56.1 MB). Free memory was 101.8 MB in the beginning and 154.0 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.08 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 150.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,300 INFO L168 Benchmark]: Boogie Preprocessor took 48.12 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 148.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,300 INFO L168 Benchmark]: RCFGBuilder took 2322.22 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 148.1 MB in the beginning and 158.1 MB in the end (delta: -10.0 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,301 INFO L168 Benchmark]: TraceAbstraction took 17406.83 ms. Allocated memory was 245.9 MB in the beginning and 473.4 MB in the end (delta: 227.5 MB). Free memory was 156.3 MB in the beginning and 199.2 MB in the end (delta: -42.9 MB). Peak memory consumption was 184.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:54,304 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.03 ms. Allocated memory was 147.3 MB in the beginning and 203.4 MB in the end (delta: 56.1 MB). Free memory was 101.8 MB in the beginning and 154.0 MB in the end (delta: -52.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.08 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 150.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.12 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 148.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2322.22 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 148.1 MB in the beginning and 158.1 MB in the end (delta: -10.0 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17406.83 ms. Allocated memory was 245.9 MB in the beginning and 473.4 MB in the end (delta: 227.5 MB). Free memory was 156.3 MB in the beginning and 199.2 MB in the end (delta: -42.9 MB). Peak memory consumption was 184.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.9s, 122 ProgramPointsBefore, 46 ProgramPointsAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 1307 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7529 CheckedPairsTotal, 88 TotalNumberOfCompositions - 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_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L714] 0 _Bool y$flush_delayed; [L715] 0 int y$mem_tmp; [L716] 0 _Bool y$r_buff0_thd0; [L717] 0 _Bool y$r_buff0_thd1; [L718] 0 _Bool y$r_buff0_thd2; [L719] 0 _Bool y$r_buff0_thd3; [L720] 0 _Bool y$r_buff0_thd4; [L721] 0 _Bool y$r_buff1_thd0; [L722] 0 _Bool y$r_buff1_thd1; [L723] 0 _Bool y$r_buff1_thd2; [L724] 0 _Bool y$r_buff1_thd3; [L725] 0 _Bool y$r_buff1_thd4; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L835] 0 pthread_t t577; [L836] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t578; [L838] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t579; [L840] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t580; [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L784] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L814] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L815] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L816] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L817] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L817] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L742] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 y$flush_delayed = weak$$choice2 [L858] 0 y$mem_tmp = y [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L860] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L860] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L861] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L862] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L862] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L864] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 781 SDtfs, 960 SDslu, 1291 SDs, 0 SdLazy, 631 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 59127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...