/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/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:03:02,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:03:02,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:03:02,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:03:02,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:03:02,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:03:02,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:03:02,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:03:02,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:03:02,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:03:02,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:03:02,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:03:02,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:03:02,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:03:02,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:03:02,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:03:02,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:03:02,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:03:02,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:03:02,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:03:02,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:03:02,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:03:02,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:03:02,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:03:02,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:03:02,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:03:02,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:03:02,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:03:02,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:03:02,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:03:02,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:03:02,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:03:02,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:03:02,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:03:02,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:03:02,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:03:02,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:03:02,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:03:02,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:03:02,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:03:02,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:03:02,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:03:02,196 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:03:02,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:03:02,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:03:02,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:03:02,200 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:03:02,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:03:02,200 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:03:02,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:03:02,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:03:02,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:03:02,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:03:02,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:03:02,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:03:02,203 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:03:02,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:03:02,204 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:03:02,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:03:02,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:03:02,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:03:02,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:03:02,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:03:02,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:03:02,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:03:02,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:03:02,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:03:02,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:03:02,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:03:02,207 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:03:02,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:03:02,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:03:02,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:03:02,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:03:02,502 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:03:02,503 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:03:02,503 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2020-10-16 12:03:02,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f93af41ca/017e429fbe97418b89e55dd2a09fcf29/FLAGa2d06db62 [2020-10-16 12:03:03,104 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:03:03,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2020-10-16 12:03:03,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f93af41ca/017e429fbe97418b89e55dd2a09fcf29/FLAGa2d06db62 [2020-10-16 12:03:03,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f93af41ca/017e429fbe97418b89e55dd2a09fcf29 [2020-10-16 12:03:03,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:03:03,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:03:03,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:03:03,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:03:03,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:03:03,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:03" (1/1) ... [2020-10-16 12:03:03,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1d40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:03, skipping insertion in model container [2020-10-16 12:03:03,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:03" (1/1) ... [2020-10-16 12:03:03,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:03:03,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:03:03,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:03:03,913 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:03:04,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:03:04,103 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:03:04,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04 WrapperNode [2020-10-16 12:03:04,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:03:04,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:03:04,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:03:04,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:03:04,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:03:04,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:03:04,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:03:04,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:03:04,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... [2020-10-16 12:03:04,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:03:04,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:03:04,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:03:04,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:03:04,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:03:04,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:03:04,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:03:04,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:03:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:03:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:03:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:03:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:03:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:03:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:03:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:03:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:03:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:03:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:03:04,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:03:04,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:03:04,310 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:03:06,291 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:03:06,292 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:03:06,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:06 BoogieIcfgContainer [2020-10-16 12:03:06,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:03:06,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:03:06,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:03:06,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:03:06,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:03:03" (1/3) ... [2020-10-16 12:03:06,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53684df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:06, skipping insertion in model container [2020-10-16 12:03:06,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:04" (2/3) ... [2020-10-16 12:03:06,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53684df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:06, skipping insertion in model container [2020-10-16 12:03:06,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:06" (3/3) ... [2020-10-16 12:03:06,304 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2020-10-16 12:03:06,316 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:03:06,317 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:03:06,325 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:03:06,326 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:03:06,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,360 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,360 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,365 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,365 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,366 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,366 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,366 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,367 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,373 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,373 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,382 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,383 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,384 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,385 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,385 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,387 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,387 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:06,389 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:03:06,403 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:03:06,424 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:03:06,424 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:03:06,425 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:03:06,425 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:03:06,425 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:03:06,425 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:03:06,425 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:03:06,425 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:03:06,440 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:03:06,441 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-16 12:03:06,444 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-16 12:03:06,446 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 12:03:06,499 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 12:03:06,500 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:03:06,505 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:03:06,510 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 12:03:08,022 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:03:08,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:03:08,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:03:08,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:03:08,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:03:08,957 WARN L193 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 12:03:09,797 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:03:10,898 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:03:11,280 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:03:11,972 WARN L193 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2020-10-16 12:03:12,261 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-16 12:03:12,647 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 12:03:12,956 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 12:03:13,732 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-16 12:03:14,103 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:03:14,721 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 12:03:15,209 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 12:03:15,675 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-16 12:03:16,030 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:03:16,338 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 12:03:16,465 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 12:03:16,473 INFO L132 LiptonReduction]: Checked pairs total: 6282 [2020-10-16 12:03:16,473 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 12:03:16,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-16 12:03:16,705 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-16 12:03:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-16 12:03:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:03:16,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:16,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:16,722 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1043443489, now seen corresponding path program 1 times [2020-10-16 12:03:16,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:16,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808557857] [2020-10-16 12:03:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:17,078 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-16 12:03:17,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808557857] [2020-10-16 12:03:17,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:17,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:17,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809242109] [2020-10-16 12:03:17,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:17,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:17,107 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-16 12:03:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:17,235 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-16 12:03:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:17,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:03:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:17,278 INFO L225 Difference]: With dead ends: 2602 [2020-10-16 12:03:17,278 INFO L226 Difference]: Without dead ends: 2122 [2020-10-16 12:03:17,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-16 12:03:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-16 12:03:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-16 12:03:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-16 12:03:17,512 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-16 12:03:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:17,513 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-16 12:03:17,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-16 12:03:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:03:17,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:17,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:17,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:03:17,519 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:17,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:17,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2021870059, now seen corresponding path program 1 times [2020-10-16 12:03:17,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:17,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782288034] [2020-10-16 12:03:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:17,653 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-16 12:03:17,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782288034] [2020-10-16 12:03:17,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:17,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:17,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364242355] [2020-10-16 12:03:17,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:17,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:17,659 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-16 12:03:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:17,721 INFO L93 Difference]: Finished difference Result 2042 states and 7736 transitions. [2020-10-16 12:03:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:17,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:03:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:17,742 INFO L225 Difference]: With dead ends: 2042 [2020-10-16 12:03:17,742 INFO L226 Difference]: Without dead ends: 2042 [2020-10-16 12:03:17,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-10-16 12:03:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2020-10-16 12:03:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2020-10-16 12:03:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7736 transitions. [2020-10-16 12:03:17,894 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7736 transitions. Word has length 11 [2020-10-16 12:03:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:17,894 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7736 transitions. [2020-10-16 12:03:17,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7736 transitions. [2020-10-16 12:03:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:03:17,897 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:17,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:17,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:03:17,898 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1746554386, now seen corresponding path program 1 times [2020-10-16 12:03:17,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:17,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55650513] [2020-10-16 12:03:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:17,975 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-16 12:03:17,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55650513] [2020-10-16 12:03:17,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:17,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:03:17,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538037947] [2020-10-16 12:03:17,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:17,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:17,978 INFO L87 Difference]: Start difference. First operand 2042 states and 7736 transitions. Second operand 4 states. [2020-10-16 12:03:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:18,066 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-10-16 12:03:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:18,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:03:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:18,086 INFO L225 Difference]: With dead ends: 1962 [2020-10-16 12:03:18,086 INFO L226 Difference]: Without dead ends: 1962 [2020-10-16 12:03:18,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-10-16 12:03:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-10-16 12:03:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-16 12:03:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-16 12:03:18,162 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-10-16 12:03:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:18,163 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-16 12:03:18,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-16 12:03:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:03:18,167 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:18,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:18,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:03:18,168 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1691310603, now seen corresponding path program 1 times [2020-10-16 12:03:18,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:18,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583193301] [2020-10-16 12:03:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:18,284 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-16 12:03:18,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583193301] [2020-10-16 12:03:18,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:18,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:18,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568384038] [2020-10-16 12:03:18,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:03:18,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:18,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:03:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:18,286 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-10-16 12:03:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:18,400 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-10-16 12:03:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:18,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:03:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:18,417 INFO L225 Difference]: With dead ends: 1898 [2020-10-16 12:03:18,417 INFO L226 Difference]: Without dead ends: 1898 [2020-10-16 12:03:18,417 INFO L677 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-16 12:03:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-10-16 12:03:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-10-16 12:03:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-16 12:03:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-10-16 12:03:18,477 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-10-16 12:03:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:18,478 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-10-16 12:03:18,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:03:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-10-16 12:03:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:03:18,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:18,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:18,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:03:18,481 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1849378380, now seen corresponding path program 1 times [2020-10-16 12:03:18,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:18,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599277489] [2020-10-16 12:03:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:18,580 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-16 12:03:18,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599277489] [2020-10-16 12:03:18,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:18,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:18,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238799414] [2020-10-16 12:03:18,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:18,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:18,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:18,582 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 4 states. [2020-10-16 12:03:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:18,652 INFO L93 Difference]: Finished difference Result 1946 states and 6628 transitions. [2020-10-16 12:03:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:03:18,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 12:03:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:18,664 INFO L225 Difference]: With dead ends: 1946 [2020-10-16 12:03:18,664 INFO L226 Difference]: Without dead ends: 1466 [2020-10-16 12:03:18,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-10-16 12:03:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1466. [2020-10-16 12:03:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2020-10-16 12:03:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 4944 transitions. [2020-10-16 12:03:18,709 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 4944 transitions. Word has length 15 [2020-10-16 12:03:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:18,709 INFO L481 AbstractCegarLoop]: Abstraction has 1466 states and 4944 transitions. [2020-10-16 12:03:18,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 4944 transitions. [2020-10-16 12:03:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:03:18,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:18,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:18,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:03:18,712 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -619361382, now seen corresponding path program 1 times [2020-10-16 12:03:18,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:18,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239506527] [2020-10-16 12:03:18,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:18,795 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-16 12:03:18,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239506527] [2020-10-16 12:03:18,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:18,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:03:18,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691292828] [2020-10-16 12:03:18,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:03:18,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:03:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:18,797 INFO L87 Difference]: Start difference. First operand 1466 states and 4944 transitions. Second operand 5 states. [2020-10-16 12:03:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:18,864 INFO L93 Difference]: Finished difference Result 1253 states and 3877 transitions. [2020-10-16 12:03:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:03:18,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:03:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:18,872 INFO L225 Difference]: With dead ends: 1253 [2020-10-16 12:03:18,872 INFO L226 Difference]: Without dead ends: 953 [2020-10-16 12:03:18,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:03:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2020-10-16 12:03:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2020-10-16 12:03:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2020-10-16 12:03:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2892 transitions. [2020-10-16 12:03:18,900 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2892 transitions. Word has length 16 [2020-10-16 12:03:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:18,901 INFO L481 AbstractCegarLoop]: Abstraction has 953 states and 2892 transitions. [2020-10-16 12:03:18,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:03:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2892 transitions. [2020-10-16 12:03:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:03:18,903 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:18,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:18,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:03:18,904 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -447792567, now seen corresponding path program 1 times [2020-10-16 12:03:18,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:18,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994028070] [2020-10-16 12:03:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:18,959 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-16 12:03:18,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994028070] [2020-10-16 12:03:18,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:18,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:18,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216530466] [2020-10-16 12:03:18,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:18,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:18,962 INFO L87 Difference]: Start difference. First operand 953 states and 2892 transitions. Second operand 4 states. [2020-10-16 12:03:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:18,987 INFO L93 Difference]: Finished difference Result 1269 states and 3758 transitions. [2020-10-16 12:03:18,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:18,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-16 12:03:18,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:18,995 INFO L225 Difference]: With dead ends: 1269 [2020-10-16 12:03:18,995 INFO L226 Difference]: Without dead ends: 977 [2020-10-16 12:03:18,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-10-16 12:03:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 953. [2020-10-16 12:03:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2020-10-16 12:03:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2812 transitions. [2020-10-16 12:03:19,024 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2812 transitions. Word has length 19 [2020-10-16 12:03:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:19,024 INFO L481 AbstractCegarLoop]: Abstraction has 953 states and 2812 transitions. [2020-10-16 12:03:19,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2812 transitions. [2020-10-16 12:03:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:03:19,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:19,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:19,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:03:19,027 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash 892055233, now seen corresponding path program 2 times [2020-10-16 12:03:19,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:19,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466156117] [2020-10-16 12:03:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:19,154 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-16 12:03:19,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466156117] [2020-10-16 12:03:19,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:19,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:03:19,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285808806] [2020-10-16 12:03:19,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:03:19,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:19,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:03:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:03:19,157 INFO L87 Difference]: Start difference. First operand 953 states and 2812 transitions. Second operand 6 states. [2020-10-16 12:03:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:19,227 INFO L93 Difference]: Finished difference Result 827 states and 2409 transitions. [2020-10-16 12:03:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:19,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:03:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:19,234 INFO L225 Difference]: With dead ends: 827 [2020-10-16 12:03:19,234 INFO L226 Difference]: Without dead ends: 728 [2020-10-16 12:03:19,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-16 12:03:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2020-10-16 12:03:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-10-16 12:03:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2155 transitions. [2020-10-16 12:03:19,256 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2155 transitions. Word has length 19 [2020-10-16 12:03:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:19,257 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 2155 transitions. [2020-10-16 12:03:19,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:03:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2155 transitions. [2020-10-16 12:03:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 12:03:19,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:19,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:19,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:03:19,261 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1449811427, now seen corresponding path program 1 times [2020-10-16 12:03:19,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:19,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659325521] [2020-10-16 12:03:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:19,343 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-16 12:03:19,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659325521] [2020-10-16 12:03:19,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:19,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:19,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557580320] [2020-10-16 12:03:19,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:03:19,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:03:19,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:19,346 INFO L87 Difference]: Start difference. First operand 728 states and 2155 transitions. Second operand 7 states. [2020-10-16 12:03:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:19,431 INFO L93 Difference]: Finished difference Result 701 states and 2100 transitions. [2020-10-16 12:03:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:03:19,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-16 12:03:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:19,434 INFO L225 Difference]: With dead ends: 701 [2020-10-16 12:03:19,435 INFO L226 Difference]: Without dead ends: 355 [2020-10-16 12:03:19,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-10-16 12:03:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2020-10-16 12:03:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-10-16 12:03:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 988 transitions. [2020-10-16 12:03:19,445 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 988 transitions. Word has length 22 [2020-10-16 12:03:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:19,445 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 988 transitions. [2020-10-16 12:03:19,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:03:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 988 transitions. [2020-10-16 12:03:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:03:19,447 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:19,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:19,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:03:19,448 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1254154008, now seen corresponding path program 1 times [2020-10-16 12:03:19,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:19,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48268893] [2020-10-16 12:03:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:19,509 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-16 12:03:19,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48268893] [2020-10-16 12:03:19,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:19,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:19,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437604587] [2020-10-16 12:03:19,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:19,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:19,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:19,512 INFO L87 Difference]: Start difference. First operand 355 states and 988 transitions. Second operand 4 states. [2020-10-16 12:03:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:19,533 INFO L93 Difference]: Finished difference Result 493 states and 1336 transitions. [2020-10-16 12:03:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:19,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-16 12:03:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:19,536 INFO L225 Difference]: With dead ends: 493 [2020-10-16 12:03:19,536 INFO L226 Difference]: Without dead ends: 219 [2020-10-16 12:03:19,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-10-16 12:03:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2020-10-16 12:03:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-16 12:03:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 540 transitions. [2020-10-16 12:03:19,542 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 540 transitions. Word has length 26 [2020-10-16 12:03:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:19,543 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 540 transitions. [2020-10-16 12:03:19,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 540 transitions. [2020-10-16 12:03:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:03:19,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:19,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:19,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:03:19,544 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2053908162, now seen corresponding path program 2 times [2020-10-16 12:03:19,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:19,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296597301] [2020-10-16 12:03:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:19,688 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-16 12:03:19,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296597301] [2020-10-16 12:03:19,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:19,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:03:19,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189901651] [2020-10-16 12:03:19,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:03:19,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:19,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:03:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:19,690 INFO L87 Difference]: Start difference. First operand 219 states and 540 transitions. Second operand 7 states. [2020-10-16 12:03:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:19,822 INFO L93 Difference]: Finished difference Result 269 states and 658 transitions. [2020-10-16 12:03:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:19,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-16 12:03:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:19,825 INFO L225 Difference]: With dead ends: 269 [2020-10-16 12:03:19,825 INFO L226 Difference]: Without dead ends: 171 [2020-10-16 12:03:19,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:03:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-16 12:03:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-16 12:03:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-16 12:03:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 392 transitions. [2020-10-16 12:03:19,830 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 392 transitions. Word has length 26 [2020-10-16 12:03:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:19,831 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 392 transitions. [2020-10-16 12:03:19,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:03:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 392 transitions. [2020-10-16 12:03:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:03:19,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:19,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:19,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:03:19,832 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1602958780, now seen corresponding path program 3 times [2020-10-16 12:03:19,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:19,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692675550] [2020-10-16 12:03:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:03:19,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:03:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:03:19,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:03:19,941 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:03:19,941 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:03:19,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:03:19,943 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:03:19,959 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L2-->L855: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In1379688387 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In1379688387 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1379688387 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In1379688387 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff0_used~0_In1379688387 ~z$w_buff0_used~0_Out1379688387)) (and .cse1 .cse2 (= ~z$w_buff0_used~0_Out1379688387 0))) (= ~z$r_buff1_thd0~0_Out1379688387 ~z$r_buff1_thd0~0_In1379688387) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1379688387 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1379688387 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1379688387|) (or (and .cse3 .cse4 (= ~z$w_buff1_used~0_Out1379688387 0)) (and (= ~z$w_buff1_used~0_Out1379688387 ~z$w_buff1_used~0_In1379688387) .cse5)) (= ~z$r_buff0_thd0~0_In1379688387 ~z$r_buff0_thd0~0_Out1379688387) (or (and .cse1 .cse2 (= ~z~0_Out1379688387 ~z$w_buff0~0_In1379688387)) (and .cse0 (or (and (= ~z~0_In1379688387 ~z~0_Out1379688387) .cse5) (and (= ~z$w_buff1~0_In1379688387 ~z~0_Out1379688387) .cse3 .cse4))))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1379688387|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1379688387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1379688387, ~z$w_buff0~0=~z$w_buff0~0_In1379688387, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1379688387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1379688387, ~z$w_buff1~0=~z$w_buff1~0_In1379688387, ~z~0=~z~0_In1379688387} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1379688387, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1379688387|, ~z$w_buff0~0=~z$w_buff0~0_In1379688387, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1379688387|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1379688387, ~z$w_buff1~0=~z$w_buff1~0_In1379688387, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1379688387|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1379688387|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1379688387|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1379688387|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1379688387|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1379688387, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1379688387, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1379688387, ~z~0=~z~0_Out1379688387} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:03:19,967 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-16 12:03:19,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,969 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-16 12:03:19,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,970 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-16 12:03:19,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,970 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-16 12:03:19,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,970 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-16 12:03:19,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,971 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-16 12:03:19,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,972 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-16 12:03:19,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,972 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-16 12:03:19,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,973 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-16 12:03:19,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,973 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-16 12:03:19,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,973 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-16 12:03:19,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,974 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-16 12:03:19,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,974 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-16 12:03:19,974 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,975 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-16 12:03:19,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,975 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-16 12:03:19,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,976 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-16 12:03:19,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,976 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-16 12:03:19,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,977 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-16 12:03:19,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,977 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-16 12:03:19,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,977 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-16 12:03:19,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,978 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-16 12:03:19,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,978 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-16 12:03:19,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,978 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-16 12:03:19,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,979 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-16 12:03:19,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,979 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-16 12:03:19,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:19,979 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-16 12:03:19,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:20,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:03:20 BasicIcfg [2020-10-16 12:03:20,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:03:20,054 INFO L168 Benchmark]: Toolchain (without parser) took 16699.74 ms. Allocated memory was 138.9 MB in the beginning and 417.3 MB in the end (delta: 278.4 MB). Free memory was 100.2 MB in the beginning and 193.9 MB in the end (delta: -93.7 MB). Peak memory consumption was 184.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,055 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.70 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 154.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.85 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 150.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,057 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,058 INFO L168 Benchmark]: RCFGBuilder took 2070.03 ms. Allocated memory was 202.9 MB in the beginning and 249.6 MB in the end (delta: 46.7 MB). Free memory was 148.1 MB in the beginning and 186.5 MB in the end (delta: -38.4 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,059 INFO L168 Benchmark]: TraceAbstraction took 13756.30 ms. Allocated memory was 249.6 MB in the beginning and 417.3 MB in the end (delta: 167.8 MB). Free memory was 186.5 MB in the beginning and 193.9 MB in the end (delta: -7.5 MB). Peak memory consumption was 160.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:20,063 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.40 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.70 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 154.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.85 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 150.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2070.03 ms. Allocated memory was 202.9 MB in the beginning and 249.6 MB in the end (delta: 46.7 MB). Free memory was 148.1 MB in the beginning and 186.5 MB in the end (delta: -38.4 MB). Peak memory consumption was 101.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13756.30 ms. Allocated memory was 249.6 MB in the beginning and 417.3 MB in the end (delta: 167.8 MB). Free memory was 186.5 MB in the beginning and 193.9 MB in the end (delta: -7.5 MB). Peak memory consumption was 160.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1359 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 138 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.0s, 124 PlacesBefore, 45 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 6282 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1149; [L838] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1150; [L840] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1151; [L842] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t1152; [L844] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 4 z$w_buff1 = z$w_buff0 [L794] 4 z$w_buff0 = 2 [L795] 4 z$w_buff1_used = z$w_buff0_used [L796] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L798] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L799] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L800] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L801] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L802] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L803] 4 z$r_buff0_thd4 = (_Bool)1 [L806] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L773] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L780] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L781] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L782] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 3 return 0; [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L822] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 4 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L858] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L859] 0 z$flush_delayed = weak$$choice2 [L860] 0 z$mem_tmp = z [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L862] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L869] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L869] 0 z = z$flush_delayed ? z$mem_tmp : z [L870] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.2s, HoareTripleCheckerStatistics: 353 SDtfs, 449 SDslu, 590 SDs, 0 SdLazy, 243 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 17493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...