/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/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:38:19,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:38:19,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:38:19,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:38:19,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:38:19,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:38:19,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:38:19,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:38:19,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:38:19,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:38:19,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:38:19,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:38:19,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:38:19,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:38:19,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:38:19,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:38:19,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:38:19,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:38:19,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:38:19,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:38:19,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:38:19,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:38:19,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:38:19,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:38:19,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:38:19,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:38:19,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:38:19,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:38:19,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:38:19,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:38:19,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:38:19,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:38:19,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:38:19,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:38:19,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:38:19,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:38:19,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:38:19,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:38:19,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:38:19,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:38:19,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:38:19,921 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:38:19,972 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:38:19,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:38:19,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:38:19,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:38:19,974 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:38:19,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:38:19,975 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:38:19,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:38:19,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:38:19,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:38:19,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:38:19,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:38:19,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:38:19,976 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:38:19,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:38:19,978 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:38:19,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:38:19,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:38:19,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:38:19,979 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:38:19,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:38:19,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:38:19,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:38:19,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:38:19,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:38:19,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:38:19,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:38:19,980 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:38:19,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:38:20,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:38:20,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:38:20,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:38:20,335 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:38:20,335 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:38:20,336 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-05 23:38:20,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181a40cf/39105bb7b5fd470891841cde7c6058b6/FLAGa5125d237 [2020-10-05 23:38:20,922 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:38:20,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-05 23:38:20,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181a40cf/39105bb7b5fd470891841cde7c6058b6/FLAGa5125d237 [2020-10-05 23:38:21,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181a40cf/39105bb7b5fd470891841cde7c6058b6 [2020-10-05 23:38:21,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:38:21,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:38:21,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:38:21,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:38:21,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:38:21,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:38:21" (1/1) ... [2020-10-05 23:38:21,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b24b73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:21, skipping insertion in model container [2020-10-05 23:38:21,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:38:21" (1/1) ... [2020-10-05 23:38:21,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:38:21,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:38:21,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:38:21,924 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:38:21,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:38:22,073 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:38:22,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22 WrapperNode [2020-10-05 23:38:22,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:38:22,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:38:22,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:38:22,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:38:22,083 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:38:22" (1/1) ... [2020-10-05 23:38:22,102 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:38:22" (1/1) ... [2020-10-05 23:38:22,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:38:22,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:38:22,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:38:22,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:38:22,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (1/1) ... [2020-10-05 23:38:22,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:38:22,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:38:22,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:38:22,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:38:22,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (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:38:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:38:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:38:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:38:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:38:22,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:38:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:38:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:38:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:38:22,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:38:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:38:22,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:38:22,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:38:22,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:38:22,287 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:38:24,600 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:38:24,600 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:38:24,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:38:24 BoogieIcfgContainer [2020-10-05 23:38:24,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:38:24,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:38:24,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:38:24,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:38:24,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:38:21" (1/3) ... [2020-10-05 23:38:24,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acaf00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:38:24, skipping insertion in model container [2020-10-05 23:38:24,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:38:22" (2/3) ... [2020-10-05 23:38:24,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acaf00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:38:24, skipping insertion in model container [2020-10-05 23:38:24,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:38:24" (3/3) ... [2020-10-05 23:38:24,612 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2020-10-05 23:38:24,623 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:38:24,623 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:38:24,632 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:38:24,634 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:38:24,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,664 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,664 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,667 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,668 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,668 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,668 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,686 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,687 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,688 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,688 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:38:24,706 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:38:24,728 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:38:24,728 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:38:24,728 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:38:24,728 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:38:24,729 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:38:24,729 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:38:24,729 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:38:24,729 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:38:24,746 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-05 23:38:24,748 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:38:24,795 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:38:24,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:38:24,800 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:38:24,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:38:24,825 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:38:24,826 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:38:24,826 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:38:24,829 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1642 [2020-10-05 23:38:24,830 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:38:26,349 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-05 23:38:26,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-05 23:38:26,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:38:26,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:38:26,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:38:27,641 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-05 23:38:27,980 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:38:28,644 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:38:28,754 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:38:29,414 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:38:29,806 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:38:30,455 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-05 23:38:30,753 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-05 23:38:32,275 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-05 23:38:32,726 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-05 23:38:33,166 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:38:33,502 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:38:33,728 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 23:38:33,842 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:38:33,866 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4410 [2020-10-05 23:38:33,867 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-10-05 23:38:33,870 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:38:33,946 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-05 23:38:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-05 23:38:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:38:33,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:33,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:38:33,972 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:33,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times [2020-10-05 23:38:33,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:33,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36461895] [2020-10-05 23:38:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:34,216 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:38:34,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36461895] [2020-10-05 23:38:34,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:34,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:38:34,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203089428] [2020-10-05 23:38:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:34,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:34,241 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-05 23:38:34,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:34,398 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-05 23:38:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:34,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:38:34,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:34,427 INFO L225 Difference]: With dead ends: 687 [2020-10-05 23:38:34,427 INFO L226 Difference]: Without dead ends: 562 [2020-10-05 23:38:34,428 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:38:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-05 23:38:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-05 23:38:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-05 23:38:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-05 23:38:34,519 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-05 23:38:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:34,519 INFO L479 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-05 23:38:34,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-05 23:38:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:38:34,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:34,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:34,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:38:34,521 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times [2020-10-05 23:38:34,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:34,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657259913] [2020-10-05 23:38:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:34,698 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:38:34,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657259913] [2020-10-05 23:38:34,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:34,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:38:34,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592603938] [2020-10-05 23:38:34,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:34,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:34,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:34,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:34,701 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-05 23:38:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:34,756 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-05 23:38:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:34,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:38:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:34,768 INFO L225 Difference]: With dead ends: 557 [2020-10-05 23:38:34,768 INFO L226 Difference]: Without dead ends: 557 [2020-10-05 23:38:34,774 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:38:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-05 23:38:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-05 23:38:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-05 23:38:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-05 23:38:34,824 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-05 23:38:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:34,826 INFO L479 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-05 23:38:34,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-05 23:38:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:38:34,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:34,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:34,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:38:34,830 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1993949950, now seen corresponding path program 1 times [2020-10-05 23:38:34,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:34,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732570976] [2020-10-05 23:38:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:34,956 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:38:34,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732570976] [2020-10-05 23:38:34,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:34,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:38:34,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197889002] [2020-10-05 23:38:34,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:34,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:34,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:34,960 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-05 23:38:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:34,997 INFO L93 Difference]: Finished difference Result 553 states and 1691 transitions. [2020-10-05 23:38:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:35,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:38:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,004 INFO L225 Difference]: With dead ends: 553 [2020-10-05 23:38:35,004 INFO L226 Difference]: Without dead ends: 553 [2020-10-05 23:38:35,005 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:38:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-05 23:38:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2020-10-05 23:38:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-05 23:38:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1691 transitions. [2020-10-05 23:38:35,024 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1691 transitions. Word has length 10 [2020-10-05 23:38:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,025 INFO L479 AbstractCegarLoop]: Abstraction has 553 states and 1691 transitions. [2020-10-05 23:38:35,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1691 transitions. [2020-10-05 23:38:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:38:35,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:38:35,027 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2146239772, now seen corresponding path program 1 times [2020-10-05 23:38:35,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457794076] [2020-10-05 23:38:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,074 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:38:35,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457794076] [2020-10-05 23:38:35,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:38:35,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809178439] [2020-10-05 23:38:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:35,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:35,077 INFO L87 Difference]: Start difference. First operand 553 states and 1691 transitions. Second operand 3 states. [2020-10-05 23:38:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,095 INFO L93 Difference]: Finished difference Result 548 states and 1672 transitions. [2020-10-05 23:38:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:35,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:38:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,101 INFO L225 Difference]: With dead ends: 548 [2020-10-05 23:38:35,101 INFO L226 Difference]: Without dead ends: 548 [2020-10-05 23:38:35,102 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:38:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-05 23:38:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-05 23:38:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-05 23:38:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1672 transitions. [2020-10-05 23:38:35,121 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1672 transitions. Word has length 10 [2020-10-05 23:38:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,122 INFO L479 AbstractCegarLoop]: Abstraction has 548 states and 1672 transitions. [2020-10-05 23:38:35,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1672 transitions. [2020-10-05 23:38:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:38:35,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:38:35,124 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1716876556, now seen corresponding path program 1 times [2020-10-05 23:38:35,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815801488] [2020-10-05 23:38:35,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,170 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:38:35,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815801488] [2020-10-05 23:38:35,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:38:35,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559782908] [2020-10-05 23:38:35,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:35,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:35,172 INFO L87 Difference]: Start difference. First operand 548 states and 1672 transitions. Second operand 3 states. [2020-10-05 23:38:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,186 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2020-10-05 23:38:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:35,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:38:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,192 INFO L225 Difference]: With dead ends: 529 [2020-10-05 23:38:35,192 INFO L226 Difference]: Without dead ends: 529 [2020-10-05 23:38:35,192 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:38:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-05 23:38:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-10-05 23:38:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-05 23:38:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-05 23:38:35,209 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 11 [2020-10-05 23:38:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,209 INFO L479 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-05 23:38:35,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-05 23:38:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:38:35,211 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:38:35,211 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1682906291, now seen corresponding path program 1 times [2020-10-05 23:38:35,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787969135] [2020-10-05 23:38:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:38:35,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787969135] [2020-10-05 23:38:35,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:35,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262289453] [2020-10-05 23:38:35,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:35,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:35,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:35,257 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states. [2020-10-05 23:38:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,310 INFO L93 Difference]: Finished difference Result 1165 states and 3454 transitions. [2020-10-05 23:38:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:35,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:38:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,317 INFO L225 Difference]: With dead ends: 1165 [2020-10-05 23:38:35,317 INFO L226 Difference]: Without dead ends: 721 [2020-10-05 23:38:35,318 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:38:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-05 23:38:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 529. [2020-10-05 23:38:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-05 23:38:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1566 transitions. [2020-10-05 23:38:35,339 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1566 transitions. Word has length 11 [2020-10-05 23:38:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,339 INFO L479 AbstractCegarLoop]: Abstraction has 529 states and 1566 transitions. [2020-10-05 23:38:35,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1566 transitions. [2020-10-05 23:38:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:38:35,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:38:35,341 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1055844487, now seen corresponding path program 2 times [2020-10-05 23:38:35,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192396193] [2020-10-05 23:38:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,393 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:38:35,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192396193] [2020-10-05 23:38:35,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:38:35,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705240723] [2020-10-05 23:38:35,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:35,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:35,396 INFO L87 Difference]: Start difference. First operand 529 states and 1566 transitions. Second operand 4 states. [2020-10-05 23:38:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,487 INFO L93 Difference]: Finished difference Result 513 states and 1510 transitions. [2020-10-05 23:38:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:38:35,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:38:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,494 INFO L225 Difference]: With dead ends: 513 [2020-10-05 23:38:35,494 INFO L226 Difference]: Without dead ends: 513 [2020-10-05 23:38:35,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-05 23:38:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-05 23:38:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-05 23:38:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1510 transitions. [2020-10-05 23:38:35,518 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1510 transitions. Word has length 11 [2020-10-05 23:38:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,519 INFO L479 AbstractCegarLoop]: Abstraction has 513 states and 1510 transitions. [2020-10-05 23:38:35,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1510 transitions. [2020-10-05 23:38:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:38:35,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:38:35,521 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 516480695, now seen corresponding path program 1 times [2020-10-05 23:38:35,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898237413] [2020-10-05 23:38:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,570 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:38:35,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898237413] [2020-10-05 23:38:35,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:38:35,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589044561] [2020-10-05 23:38:35,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:35,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:35,573 INFO L87 Difference]: Start difference. First operand 513 states and 1510 transitions. Second operand 3 states. [2020-10-05 23:38:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,584 INFO L93 Difference]: Finished difference Result 494 states and 1443 transitions. [2020-10-05 23:38:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:35,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:38:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,592 INFO L225 Difference]: With dead ends: 494 [2020-10-05 23:38:35,592 INFO L226 Difference]: Without dead ends: 494 [2020-10-05 23:38:35,592 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:38:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-05 23:38:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2020-10-05 23:38:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-10-05 23:38:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1443 transitions. [2020-10-05 23:38:35,614 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1443 transitions. Word has length 12 [2020-10-05 23:38:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,615 INFO L479 AbstractCegarLoop]: Abstraction has 494 states and 1443 transitions. [2020-10-05 23:38:35,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1443 transitions. [2020-10-05 23:38:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:38:35,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:38:35,617 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1168968894, now seen corresponding path program 1 times [2020-10-05 23:38:35,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650268854] [2020-10-05 23:38:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,668 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:38:35,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650268854] [2020-10-05 23:38:35,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:38:35,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324163235] [2020-10-05 23:38:35,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:38:35,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:38:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:38:35,671 INFO L87 Difference]: Start difference. First operand 494 states and 1443 transitions. Second operand 3 states. [2020-10-05 23:38:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,700 INFO L93 Difference]: Finished difference Result 665 states and 1896 transitions. [2020-10-05 23:38:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:38:35,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:38:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,706 INFO L225 Difference]: With dead ends: 665 [2020-10-05 23:38:35,706 INFO L226 Difference]: Without dead ends: 413 [2020-10-05 23:38:35,706 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:38:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-05 23:38:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 377. [2020-10-05 23:38:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-05 23:38:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1068 transitions. [2020-10-05 23:38:35,720 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1068 transitions. Word has length 13 [2020-10-05 23:38:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,721 INFO L479 AbstractCegarLoop]: Abstraction has 377 states and 1068 transitions. [2020-10-05 23:38:35,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:38:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1068 transitions. [2020-10-05 23:38:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:38:35,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:38:35,722 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -549128060, now seen corresponding path program 1 times [2020-10-05 23:38:35,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629972087] [2020-10-05 23:38:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,771 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:38:35,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629972087] [2020-10-05 23:38:35,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:38:35,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378980843] [2020-10-05 23:38:35,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:35,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:35,774 INFO L87 Difference]: Start difference. First operand 377 states and 1068 transitions. Second operand 4 states. [2020-10-05 23:38:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,806 INFO L93 Difference]: Finished difference Result 545 states and 1546 transitions. [2020-10-05 23:38:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:38:35,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:38:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,810 INFO L225 Difference]: With dead ends: 545 [2020-10-05 23:38:35,811 INFO L226 Difference]: Without dead ends: 245 [2020-10-05 23:38:35,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-05 23:38:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2020-10-05 23:38:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-10-05 23:38:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 683 transitions. [2020-10-05 23:38:35,820 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 683 transitions. Word has length 13 [2020-10-05 23:38:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,820 INFO L479 AbstractCegarLoop]: Abstraction has 245 states and 683 transitions. [2020-10-05 23:38:35,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 683 transitions. [2020-10-05 23:38:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:38:35,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:38:35,822 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1878284186, now seen corresponding path program 1 times [2020-10-05 23:38:35,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178120646] [2020-10-05 23:38:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,861 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:38:35,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178120646] [2020-10-05 23:38:35,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:35,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489773755] [2020-10-05 23:38:35,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:35,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:35,863 INFO L87 Difference]: Start difference. First operand 245 states and 683 transitions. Second operand 4 states. [2020-10-05 23:38:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:35,892 INFO L93 Difference]: Finished difference Result 353 states and 980 transitions. [2020-10-05 23:38:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:38:35,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:38:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:35,895 INFO L225 Difference]: With dead ends: 353 [2020-10-05 23:38:35,895 INFO L226 Difference]: Without dead ends: 209 [2020-10-05 23:38:35,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-05 23:38:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-05 23:38:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-05 23:38:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 563 transitions. [2020-10-05 23:38:35,905 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 563 transitions. Word has length 14 [2020-10-05 23:38:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:35,906 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 563 transitions. [2020-10-05 23:38:35,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 563 transitions. [2020-10-05 23:38:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:38:35,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:35,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:35,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:38:35,907 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1878298136, now seen corresponding path program 2 times [2020-10-05 23:38:35,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:35,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788233019] [2020-10-05 23:38:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:35,992 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:38:35,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788233019] [2020-10-05 23:38:35,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:35,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:35,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498007793] [2020-10-05 23:38:35,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:38:35,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:38:35,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:35,995 INFO L87 Difference]: Start difference. First operand 209 states and 563 transitions. Second operand 5 states. [2020-10-05 23:38:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:36,105 INFO L93 Difference]: Finished difference Result 208 states and 559 transitions. [2020-10-05 23:38:36,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:38:36,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:38:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:36,108 INFO L225 Difference]: With dead ends: 208 [2020-10-05 23:38:36,108 INFO L226 Difference]: Without dead ends: 208 [2020-10-05 23:38:36,109 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:38:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-05 23:38:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2020-10-05 23:38:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-05 23:38:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 559 transitions. [2020-10-05 23:38:36,115 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 559 transitions. Word has length 14 [2020-10-05 23:38:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:36,116 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 559 transitions. [2020-10-05 23:38:36,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:38:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 559 transitions. [2020-10-05 23:38:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:38:36,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:36,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:38:36,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:38:36,118 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times [2020-10-05 23:38:36,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:36,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153294684] [2020-10-05 23:38:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:36,184 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:38:36,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153294684] [2020-10-05 23:38:36,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:36,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:38:36,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213168528] [2020-10-05 23:38:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:38:36,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:38:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:38:36,186 INFO L87 Difference]: Start difference. First operand 208 states and 559 transitions. Second operand 4 states. [2020-10-05 23:38:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:36,220 INFO L93 Difference]: Finished difference Result 206 states and 485 transitions. [2020-10-05 23:38:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:36,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:38:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:36,222 INFO L225 Difference]: With dead ends: 206 [2020-10-05 23:38:36,222 INFO L226 Difference]: Without dead ends: 153 [2020-10-05 23:38:36,223 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:38:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-05 23:38:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-10-05 23:38:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:38:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 355 transitions. [2020-10-05 23:38:36,228 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 355 transitions. Word has length 15 [2020-10-05 23:38:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:36,229 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 355 transitions. [2020-10-05 23:38:36,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:38:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 355 transitions. [2020-10-05 23:38:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:38:36,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:36,230 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:38:36,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:38:36,230 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2130702573, now seen corresponding path program 1 times [2020-10-05 23:38:36,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:36,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319542387] [2020-10-05 23:38:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:36,304 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:38:36,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319542387] [2020-10-05 23:38:36,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:36,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:38:36,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870897063] [2020-10-05 23:38:36,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:38:36,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:38:36,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:38:36,307 INFO L87 Difference]: Start difference. First operand 153 states and 355 transitions. Second operand 5 states. [2020-10-05 23:38:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:36,354 INFO L93 Difference]: Finished difference Result 124 states and 251 transitions. [2020-10-05 23:38:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:38:36,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:38:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:36,356 INFO L225 Difference]: With dead ends: 124 [2020-10-05 23:38:36,356 INFO L226 Difference]: Without dead ends: 93 [2020-10-05 23:38:36,357 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:38:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-05 23:38:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-05 23:38:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-05 23:38:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 179 transitions. [2020-10-05 23:38:36,360 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 179 transitions. Word has length 16 [2020-10-05 23:38:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:36,360 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 179 transitions. [2020-10-05 23:38:36,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:38:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 179 transitions. [2020-10-05 23:38:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:38:36,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:36,361 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:38:36,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:38:36,362 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times [2020-10-05 23:38:36,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:36,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81733922] [2020-10-05 23:38:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:36,460 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:38:36,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81733922] [2020-10-05 23:38:36,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:36,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:38:36,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417227907] [2020-10-05 23:38:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:38:36,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:38:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:38:36,463 INFO L87 Difference]: Start difference. First operand 93 states and 179 transitions. Second operand 6 states. [2020-10-05 23:38:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:36,531 INFO L93 Difference]: Finished difference Result 79 states and 149 transitions. [2020-10-05 23:38:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:38:36,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:38:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:36,534 INFO L225 Difference]: With dead ends: 79 [2020-10-05 23:38:36,534 INFO L226 Difference]: Without dead ends: 70 [2020-10-05 23:38:36,535 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:38:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-05 23:38:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-05 23:38:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-05 23:38:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2020-10-05 23:38:36,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 18 [2020-10-05 23:38:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:36,538 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2020-10-05 23:38:36,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:38:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2020-10-05 23:38:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:38:36,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:36,540 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:38:36,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:38:36,540 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times [2020-10-05 23:38:36,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:36,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75021896] [2020-10-05 23:38:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:38:36,803 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:38:36,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75021896] [2020-10-05 23:38:36,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:38:36,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:38:36,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114228597] [2020-10-05 23:38:36,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:38:36,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:38:36,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:38:36,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:38:36,807 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 8 states. [2020-10-05 23:38:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:38:36,932 INFO L93 Difference]: Finished difference Result 90 states and 168 transitions. [2020-10-05 23:38:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:38:36,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-05 23:38:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:38:36,934 INFO L225 Difference]: With dead ends: 90 [2020-10-05 23:38:36,934 INFO L226 Difference]: Without dead ends: 50 [2020-10-05 23:38:36,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:38:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-05 23:38:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-05 23:38:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-05 23:38:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-05 23:38:36,937 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-10-05 23:38:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:38:36,938 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-05 23:38:36,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:38:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-05 23:38:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:38:36,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:38:36,939 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:38:36,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:38:36,939 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:38:36,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:38:36,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times [2020-10-05 23:38:36,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:38:36,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949040717] [2020-10-05 23:38:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:38:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:38:37,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:38:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:38:37,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:38:37,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:38:37,128 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:38:37,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:38:37,130 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:38:37,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In1429835510 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In1429835510 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In1429835510 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In1429835510 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1429835510 0)) (or (and .cse0 (= ~x$w_buff0~0_In1429835510 ~x~0_Out1429835510) .cse1) (and (or (and (= ~x~0_In1429835510 ~x~0_Out1429835510) .cse2) (and .cse3 .cse4 (= ~x$w_buff1~0_In1429835510 ~x~0_Out1429835510))) .cse5)) (= ~x$r_buff0_thd0~0_Out1429835510 ~x$r_buff0_thd0~0_In1429835510) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1429835510 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1429835510|) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out1429835510 0)) (and (= ~x$w_buff0_used~0_Out1429835510 ~x$w_buff0_used~0_In1429835510) .cse5)) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out1429835510 0)) (and .cse2 (= ~x$w_buff1_used~0_In1429835510 ~x$w_buff1_used~0_Out1429835510))) (= ~x$r_buff1_thd0~0_In1429835510 ~x$r_buff1_thd0~0_Out1429835510)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1429835510, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1429835510, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1429835510|, ~x$w_buff1~0=~x$w_buff1~0_In1429835510, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1429835510, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1429835510, ~x~0=~x~0_In1429835510, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1429835510} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1429835510, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1429835510, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1429835510|, ~x$w_buff1~0=~x$w_buff1~0_In1429835510, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1429835510|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1429835510, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1429835510|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1429835510|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1429835510|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1429835510, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1429835510, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1429835510|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1429835510|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1429835510, ~x~0=~x~0_Out1429835510} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:38:37,152 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:38:37,152 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,157 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:38:37,157 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,157 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:38:37,158 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,159 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:38:37,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,159 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:38:37,159 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,160 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:38:37,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,160 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:38:37,160 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,160 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:38:37,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,161 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:38:37,161 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,162 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:38:37,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,162 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:38:37,162 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,163 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:38:37,163 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,163 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:38:37,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,164 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:38:37,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,164 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:38:37,164 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,164 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:38:37,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,165 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:38:37,165 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,166 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:38:37,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,166 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:38:37,166 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,170 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:38:37,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,171 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:38:37,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,171 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:38:37,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,172 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:38:37,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,172 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:38:37,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,172 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:38:37,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,173 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:38:37,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,173 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:38:37,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,173 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:38:37,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,173 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:38:37,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,174 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:38:37,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,174 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:38:37,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,174 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:38:37,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:38:37,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:38:37 BasicIcfg [2020-10-05 23:38:37,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:38:37,264 INFO L168 Benchmark]: Toolchain (without parser) took 16026.16 ms. Allocated memory was 141.0 MB in the beginning and 367.0 MB in the end (delta: 226.0 MB). Free memory was 103.0 MB in the beginning and 175.4 MB in the end (delta: -72.4 MB). Peak memory consumption was 153.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,265 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.59 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 102.5 MB in the beginning and 157.0 MB in the end (delta: -54.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.63 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,267 INFO L168 Benchmark]: Boogie Preprocessor took 41.19 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,268 INFO L168 Benchmark]: RCFGBuilder took 2419.16 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 151.2 MB in the beginning and 160.5 MB in the end (delta: -9.2 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,268 INFO L168 Benchmark]: TraceAbstraction took 12658.66 ms. Allocated memory was 246.4 MB in the beginning and 367.0 MB in the end (delta: 120.6 MB). Free memory was 158.7 MB in the beginning and 175.4 MB in the end (delta: -16.7 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:38:37,272 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.59 ms. Allocated memory was 141.0 MB in the beginning and 203.4 MB in the end (delta: 62.4 MB). Free memory was 102.5 MB in the beginning and 157.0 MB in the end (delta: -54.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.63 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.19 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2419.16 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 151.2 MB in the beginning and 160.5 MB in the end (delta: -9.2 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12658.66 ms. Allocated memory was 246.4 MB in the beginning and 367.0 MB in the end (delta: 120.6 MB). Free memory was 158.7 MB in the beginning and 175.4 MB in the end (delta: -16.7 MB). Peak memory consumption was 103.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.1s, 100 ProgramPointsBefore, 36 ProgramPointsAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 810 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4410 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1888; [L808] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t1889; [L810] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 0 pthread_t t1890; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L785] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 362 SDtfs, 276 SDslu, 437 SDs, 0 SdLazy, 260 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 228 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 15032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...