/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:07:43,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:07:43,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:07:43,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:07:43,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:07:43,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:07:43,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:07:43,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:07:43,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:07:43,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:07:43,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:07:43,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:07:43,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:07:43,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:07:43,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:07:43,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:07:43,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:07:43,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:07:43,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:07:43,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:07:43,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:07:43,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:07:43,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:07:43,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:07:44,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:07:44,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:07:44,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:07:44,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:07:44,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:07:44,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:07:44,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:07:44,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:07:44,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:07:44,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:07:44,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:07:44,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:07:44,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:07:44,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:07:44,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:07:44,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:07:44,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:07:44,019 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:07:44,041 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:07:44,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:07:44,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:07:44,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:07:44,043 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:07:44,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:07:44,043 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:07:44,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:07:44,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:07:44,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:07:44,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:07:44,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:07:44,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:07:44,045 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:07:44,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:07:44,045 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:07:44,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:07:44,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:07:44,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:07:44,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:07:44,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:07:44,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:07:44,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:07:44,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:07:44,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:07:44,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:07:44,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:07:44,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:07:44,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:07:44,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:07:44,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:07:44,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:07:44,318 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:07:44,319 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:07:44,319 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-16 12:07:44,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d25cf1dbc/cc59bb33c9334ff2aacf7e29e2cdf48f/FLAGd2e01e6fe [2020-10-16 12:07:44,919 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:07:44,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe004_rmo.opt.i [2020-10-16 12:07:44,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d25cf1dbc/cc59bb33c9334ff2aacf7e29e2cdf48f/FLAGd2e01e6fe [2020-10-16 12:07:45,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d25cf1dbc/cc59bb33c9334ff2aacf7e29e2cdf48f [2020-10-16 12:07:45,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:07:45,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:07:45,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:45,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:07:45,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:07:45,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:45" (1/1) ... [2020-10-16 12:07:45,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e94cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:45, skipping insertion in model container [2020-10-16 12:07:45,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:45" (1/1) ... [2020-10-16 12:07:45,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:07:45,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:07:45,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:45,868 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:07:45,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:45,999 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:07:46,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46 WrapperNode [2020-10-16 12:07:46,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:46,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:46,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:07:46,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:07:46,010 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:07:46" (1/1) ... [2020-10-16 12:07:46,030 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:07:46" (1/1) ... [2020-10-16 12:07:46,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:46,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:07:46,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:07:46,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:07:46,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (1/1) ... [2020-10-16 12:07:46,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:07:46,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:07:46,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:07:46,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:07:46,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (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:07:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:07:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:07:46,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:07:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:07:46,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:07:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:07:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:07:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:07:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:07:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:07:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:07:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:07:46,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:07:46,171 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:07:48,165 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:07:48,165 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:07:48,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:48 BoogieIcfgContainer [2020-10-16 12:07:48,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:07:48,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:07:48,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:07:48,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:07:48,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:07:45" (1/3) ... [2020-10-16 12:07:48,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605996fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:48, skipping insertion in model container [2020-10-16 12:07:48,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:46" (2/3) ... [2020-10-16 12:07:48,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605996fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:48, skipping insertion in model container [2020-10-16 12:07:48,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:48" (3/3) ... [2020-10-16 12:07:48,180 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_rmo.opt.i [2020-10-16 12:07:48,191 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:07:48,192 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:07:48,199 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:07:48,200 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:07:48,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,241 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,242 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,267 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,270 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,270 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:48,274 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:07:48,288 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:07:48,310 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:07:48,310 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:07:48,311 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:07:48,311 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:07:48,311 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:07:48,312 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:07:48,312 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:07:48,312 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:07:48,333 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:07:48,335 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:48,338 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:48,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:48,404 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 12:07:48,404 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:07:48,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:07:48,415 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 12:07:49,801 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 12:07:49,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 12:07:49,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:49,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:07:49,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:50,922 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-16 12:07:51,781 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:07:52,549 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:07:52,872 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:07:53,668 WARN L193 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 12:07:53,961 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:07:55,386 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-16 12:07:55,817 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:07:56,267 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:56,574 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:56,785 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:07:56,889 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:07:56,911 INFO L132 LiptonReduction]: Checked pairs total: 4586 [2020-10-16 12:07:56,911 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 12:07:56,918 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:07:56,971 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-16 12:07:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-16 12:07:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:07:56,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:56,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:07:56,981 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times [2020-10-16 12:07:56,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:56,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729933612] [2020-10-16 12:07:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:57,228 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:07:57,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729933612] [2020-10-16 12:07:57,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:57,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:57,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841755281] [2020-10-16 12:07:57,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:57,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:57,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:57,257 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-16 12:07:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:57,375 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 12:07:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:57,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:07:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:57,402 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:07:57,402 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 12:07:57,404 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:07:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 12:07:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 12:07:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 12:07:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 12:07:57,547 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-16 12:07:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:57,548 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 12:07:57,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 12:07:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:07:57,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:57,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:57,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:07:57,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times [2020-10-16 12:07:57,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:57,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254373654] [2020-10-16 12:07:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:57,677 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:07:57,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254373654] [2020-10-16 12:07:57,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:57,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:57,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646320418] [2020-10-16 12:07:57,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:57,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:57,681 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 12:07:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:57,731 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-16 12:07:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:57,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:07:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:57,738 INFO L225 Difference]: With dead ends: 557 [2020-10-16 12:07:57,738 INFO L226 Difference]: Without dead ends: 557 [2020-10-16 12:07:57,739 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:07:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-16 12:07:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-16 12:07:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-16 12:07:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-16 12:07:57,759 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-16 12:07:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:57,760 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-16 12:07:57,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-16 12:07:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:07:57,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:57,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:57,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:07:57,763 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1993949950, now seen corresponding path program 1 times [2020-10-16 12:07:57,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:57,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465700399] [2020-10-16 12:07:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:57,823 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:07:57,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465700399] [2020-10-16 12:07:57,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:57,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:57,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86136068] [2020-10-16 12:07:57,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:57,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:57,826 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-16 12:07:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:57,857 INFO L93 Difference]: Finished difference Result 553 states and 1691 transitions. [2020-10-16 12:07:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:57,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:07:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:57,863 INFO L225 Difference]: With dead ends: 553 [2020-10-16 12:07:57,863 INFO L226 Difference]: Without dead ends: 553 [2020-10-16 12:07:57,863 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:07:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-10-16 12:07:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2020-10-16 12:07:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-16 12:07:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1691 transitions. [2020-10-16 12:07:57,880 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1691 transitions. Word has length 10 [2020-10-16 12:07:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:57,881 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 1691 transitions. [2020-10-16 12:07:57,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1691 transitions. [2020-10-16 12:07:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:07:57,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:57,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:57,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:07:57,883 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2146239772, now seen corresponding path program 1 times [2020-10-16 12:07:57,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:57,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439007935] [2020-10-16 12:07:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:57,961 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:07:57,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439007935] [2020-10-16 12:07:57,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:57,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:57,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681926371] [2020-10-16 12:07:57,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:57,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:57,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:57,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:57,964 INFO L87 Difference]: Start difference. First operand 553 states and 1691 transitions. Second operand 3 states. [2020-10-16 12:07:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:57,987 INFO L93 Difference]: Finished difference Result 548 states and 1672 transitions. [2020-10-16 12:07:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:57,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:07:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:57,994 INFO L225 Difference]: With dead ends: 548 [2020-10-16 12:07:57,994 INFO L226 Difference]: Without dead ends: 548 [2020-10-16 12:07:57,995 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:07:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-16 12:07:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-16 12:07:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-16 12:07:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1672 transitions. [2020-10-16 12:07:58,020 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1672 transitions. Word has length 10 [2020-10-16 12:07:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,023 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1672 transitions. [2020-10-16 12:07:58,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1672 transitions. [2020-10-16 12:07:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:07:58,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:07:58,028 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1716876556, now seen corresponding path program 1 times [2020-10-16 12:07:58,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810203490] [2020-10-16 12:07:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,071 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:07:58,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810203490] [2020-10-16 12:07:58,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:58,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533071349] [2020-10-16 12:07:58,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:58,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:58,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:58,073 INFO L87 Difference]: Start difference. First operand 548 states and 1672 transitions. Second operand 3 states. [2020-10-16 12:07:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,085 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2020-10-16 12:07:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:58,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:07:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,091 INFO L225 Difference]: With dead ends: 529 [2020-10-16 12:07:58,091 INFO L226 Difference]: Without dead ends: 529 [2020-10-16 12:07:58,091 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:07:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-16 12:07:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2020-10-16 12:07:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-16 12:07:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-16 12:07:58,107 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 11 [2020-10-16 12:07:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,107 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-16 12:07:58,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-16 12:07:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:07:58,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:07:58,109 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1682906291, now seen corresponding path program 1 times [2020-10-16 12:07:58,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805768730] [2020-10-16 12:07:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,151 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:07:58,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805768730] [2020-10-16 12:07:58,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:58,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103330170] [2020-10-16 12:07:58,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:58,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:58,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:58,153 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states. [2020-10-16 12:07:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,204 INFO L93 Difference]: Finished difference Result 1165 states and 3454 transitions. [2020-10-16 12:07:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:58,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:07:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,211 INFO L225 Difference]: With dead ends: 1165 [2020-10-16 12:07:58,211 INFO L226 Difference]: Without dead ends: 721 [2020-10-16 12:07:58,212 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:07:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-16 12:07:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 529. [2020-10-16 12:07:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-16 12:07:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1566 transitions. [2020-10-16 12:07:58,229 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1566 transitions. Word has length 11 [2020-10-16 12:07:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,229 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1566 transitions. [2020-10-16 12:07:58,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1566 transitions. [2020-10-16 12:07:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:07:58,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:07:58,231 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1055844487, now seen corresponding path program 2 times [2020-10-16 12:07:58,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76377180] [2020-10-16 12:07:58,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,305 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:07:58,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76377180] [2020-10-16 12:07:58,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:58,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711452183] [2020-10-16 12:07:58,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:58,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:58,308 INFO L87 Difference]: Start difference. First operand 529 states and 1566 transitions. Second operand 4 states. [2020-10-16 12:07:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,383 INFO L93 Difference]: Finished difference Result 513 states and 1510 transitions. [2020-10-16 12:07:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:58,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:07:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,388 INFO L225 Difference]: With dead ends: 513 [2020-10-16 12:07:58,388 INFO L226 Difference]: Without dead ends: 513 [2020-10-16 12:07:58,388 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:07:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-16 12:07:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-16 12:07:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-16 12:07:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1510 transitions. [2020-10-16 12:07:58,403 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1510 transitions. Word has length 11 [2020-10-16 12:07:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,404 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1510 transitions. [2020-10-16 12:07:58,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1510 transitions. [2020-10-16 12:07:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:58,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:07:58,405 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash 516480695, now seen corresponding path program 1 times [2020-10-16 12:07:58,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331304067] [2020-10-16 12:07:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,470 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:07:58,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331304067] [2020-10-16 12:07:58,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:58,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484678477] [2020-10-16 12:07:58,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:58,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:58,472 INFO L87 Difference]: Start difference. First operand 513 states and 1510 transitions. Second operand 4 states. [2020-10-16 12:07:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,499 INFO L93 Difference]: Finished difference Result 494 states and 1443 transitions. [2020-10-16 12:07:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:58,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:07:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,504 INFO L225 Difference]: With dead ends: 494 [2020-10-16 12:07:58,504 INFO L226 Difference]: Without dead ends: 494 [2020-10-16 12:07:58,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-16 12:07:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2020-10-16 12:07:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-10-16 12:07:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1443 transitions. [2020-10-16 12:07:58,524 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1443 transitions. Word has length 12 [2020-10-16 12:07:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,525 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1443 transitions. [2020-10-16 12:07:58,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1443 transitions. [2020-10-16 12:07:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:58,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:07:58,527 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1168968894, now seen corresponding path program 1 times [2020-10-16 12:07:58,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894645729] [2020-10-16 12:07:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,587 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:07:58,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894645729] [2020-10-16 12:07:58,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:58,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196018390] [2020-10-16 12:07:58,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:58,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:58,589 INFO L87 Difference]: Start difference. First operand 494 states and 1443 transitions. Second operand 3 states. [2020-10-16 12:07:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,621 INFO L93 Difference]: Finished difference Result 665 states and 1896 transitions. [2020-10-16 12:07:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:58,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:07:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,625 INFO L225 Difference]: With dead ends: 665 [2020-10-16 12:07:58,625 INFO L226 Difference]: Without dead ends: 413 [2020-10-16 12:07:58,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-16 12:07:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 377. [2020-10-16 12:07:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-16 12:07:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1068 transitions. [2020-10-16 12:07:58,638 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1068 transitions. Word has length 13 [2020-10-16 12:07:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,638 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1068 transitions. [2020-10-16 12:07:58,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1068 transitions. [2020-10-16 12:07:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:58,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:07:58,640 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash -549128060, now seen corresponding path program 1 times [2020-10-16 12:07:58,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206273739] [2020-10-16 12:07:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,697 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:07:58,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206273739] [2020-10-16 12:07:58,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:58,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254927323] [2020-10-16 12:07:58,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:58,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:58,699 INFO L87 Difference]: Start difference. First operand 377 states and 1068 transitions. Second operand 4 states. [2020-10-16 12:07:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,728 INFO L93 Difference]: Finished difference Result 593 states and 1626 transitions. [2020-10-16 12:07:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:58,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,731 INFO L225 Difference]: With dead ends: 593 [2020-10-16 12:07:58,731 INFO L226 Difference]: Without dead ends: 353 [2020-10-16 12:07:58,732 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:07:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-10-16 12:07:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 317. [2020-10-16 12:07:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-16 12:07:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 872 transitions. [2020-10-16 12:07:58,741 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 872 transitions. Word has length 13 [2020-10-16 12:07:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,745 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 872 transitions. [2020-10-16 12:07:58,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 872 transitions. [2020-10-16 12:07:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:58,746 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:07:58,746 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash -549142010, now seen corresponding path program 2 times [2020-10-16 12:07:58,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504515139] [2020-10-16 12:07:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,807 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:07:58,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504515139] [2020-10-16 12:07:58,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:58,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801567305] [2020-10-16 12:07:58,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:58,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:58,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:58,810 INFO L87 Difference]: Start difference. First operand 317 states and 872 transitions. Second operand 4 states. [2020-10-16 12:07:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:58,840 INFO L93 Difference]: Finished difference Result 440 states and 1209 transitions. [2020-10-16 12:07:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:58,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:58,843 INFO L225 Difference]: With dead ends: 440 [2020-10-16 12:07:58,843 INFO L226 Difference]: Without dead ends: 215 [2020-10-16 12:07:58,843 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:07:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-16 12:07:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2020-10-16 12:07:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-16 12:07:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 579 transitions. [2020-10-16 12:07:58,850 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 579 transitions. Word has length 13 [2020-10-16 12:07:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:58,850 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 579 transitions. [2020-10-16 12:07:58,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 579 transitions. [2020-10-16 12:07:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:07:58,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:58,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:58,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:07:58,852 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1878298136, now seen corresponding path program 1 times [2020-10-16 12:07:58,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:58,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387017206] [2020-10-16 12:07:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:58,957 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:07:58,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387017206] [2020-10-16 12:07:58,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:58,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:58,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198249796] [2020-10-16 12:07:58,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:58,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:58,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:58,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:58,960 INFO L87 Difference]: Start difference. First operand 215 states and 579 transitions. Second operand 5 states. [2020-10-16 12:07:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:59,038 INFO L93 Difference]: Finished difference Result 214 states and 575 transitions. [2020-10-16 12:07:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:59,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:07:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:59,041 INFO L225 Difference]: With dead ends: 214 [2020-10-16 12:07:59,041 INFO L226 Difference]: Without dead ends: 214 [2020-10-16 12:07:59,041 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:07:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-16 12:07:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-16 12:07:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-16 12:07:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 575 transitions. [2020-10-16 12:07:59,049 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 575 transitions. Word has length 14 [2020-10-16 12:07:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:59,051 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 575 transitions. [2020-10-16 12:07:59,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 575 transitions. [2020-10-16 12:07:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:07:59,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:59,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:59,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:07:59,053 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times [2020-10-16 12:07:59,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:59,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969446351] [2020-10-16 12:07:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:59,193 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:07:59,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969446351] [2020-10-16 12:07:59,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:59,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:59,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129904464] [2020-10-16 12:07:59,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:59,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:59,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:59,195 INFO L87 Difference]: Start difference. First operand 214 states and 575 transitions. Second operand 4 states. [2020-10-16 12:07:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:59,224 INFO L93 Difference]: Finished difference Result 210 states and 495 transitions. [2020-10-16 12:07:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:59,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 12:07:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:59,226 INFO L225 Difference]: With dead ends: 210 [2020-10-16 12:07:59,226 INFO L226 Difference]: Without dead ends: 155 [2020-10-16 12:07:59,226 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:07:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-16 12:07:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-10-16 12:07:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-16 12:07:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 359 transitions. [2020-10-16 12:07:59,231 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 359 transitions. Word has length 15 [2020-10-16 12:07:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:59,231 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 359 transitions. [2020-10-16 12:07:59,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 359 transitions. [2020-10-16 12:07:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:07:59,232 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:59,232 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:07:59,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:07:59,232 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2130702573, now seen corresponding path program 1 times [2020-10-16 12:07:59,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:59,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294873978] [2020-10-16 12:07:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:59,349 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:07:59,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294873978] [2020-10-16 12:07:59,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:59,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:59,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310344885] [2020-10-16 12:07:59,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:59,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:59,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:59,351 INFO L87 Difference]: Start difference. First operand 155 states and 359 transitions. Second operand 5 states. [2020-10-16 12:07:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:59,393 INFO L93 Difference]: Finished difference Result 126 states and 255 transitions. [2020-10-16 12:07:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:59,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:07:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:59,394 INFO L225 Difference]: With dead ends: 126 [2020-10-16 12:07:59,395 INFO L226 Difference]: Without dead ends: 95 [2020-10-16 12:07:59,395 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:07:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-16 12:07:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-10-16 12:07:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-16 12:07:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 183 transitions. [2020-10-16 12:07:59,398 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 183 transitions. Word has length 16 [2020-10-16 12:07:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:59,398 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 183 transitions. [2020-10-16 12:07:59,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 183 transitions. [2020-10-16 12:07:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:07:59,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:59,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:59,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:07:59,400 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times [2020-10-16 12:07:59,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:59,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226233280] [2020-10-16 12:07:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:59,497 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:07:59,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226233280] [2020-10-16 12:07:59,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:59,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:07:59,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834297190] [2020-10-16 12:07:59,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:59,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:59,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:59,499 INFO L87 Difference]: Start difference. First operand 95 states and 183 transitions. Second operand 6 states. [2020-10-16 12:07:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:59,548 INFO L93 Difference]: Finished difference Result 81 states and 153 transitions. [2020-10-16 12:07:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:07:59,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 12:07:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:59,549 INFO L225 Difference]: With dead ends: 81 [2020-10-16 12:07:59,550 INFO L226 Difference]: Without dead ends: 72 [2020-10-16 12:07:59,550 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:07:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-16 12:07:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-16 12:07:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-16 12:07:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 137 transitions. [2020-10-16 12:07:59,552 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 137 transitions. Word has length 18 [2020-10-16 12:07:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:59,553 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 137 transitions. [2020-10-16 12:07:59,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 137 transitions. [2020-10-16 12:07:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:59,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:59,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:59,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:07:59,554 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:59,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times [2020-10-16 12:07:59,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:59,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936692687] [2020-10-16 12:07:59,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:59,708 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:07:59,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936692687] [2020-10-16 12:07:59,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:59,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:07:59,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738742077] [2020-10-16 12:07:59,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:07:59,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:07:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:07:59,710 INFO L87 Difference]: Start difference. First operand 72 states and 137 transitions. Second operand 7 states. [2020-10-16 12:07:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:59,831 INFO L93 Difference]: Finished difference Result 98 states and 185 transitions. [2020-10-16 12:07:59,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:59,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:07:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:59,832 INFO L225 Difference]: With dead ends: 98 [2020-10-16 12:07:59,833 INFO L226 Difference]: Without dead ends: 54 [2020-10-16 12:07:59,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:07:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-16 12:07:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-10-16 12:07:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-16 12:07:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2020-10-16 12:07:59,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 21 [2020-10-16 12:07:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:59,835 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2020-10-16 12:07:59,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:07:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2020-10-16 12:07:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:59,836 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:59,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:59,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:07:59,837 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times [2020-10-16 12:07:59,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:59,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149803583] [2020-10-16 12:07:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:59,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:59,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:59,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:07:59,942 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:07:59,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:07:59,944 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:07:59,954 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In1283390214 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In1283390214 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In1283390214 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1283390214 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out1283390214 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1283390214|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1283390214 0)) (or (and .cse0 (= ~x$w_buff1_used~0_Out1283390214 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_In1283390214 ~x$w_buff1_used~0_Out1283390214))) (= ~x$r_buff1_thd0~0_In1283390214 ~x$r_buff1_thd0~0_Out1283390214) (or (and .cse3 (or (and (= ~x$w_buff1~0_In1283390214 ~x~0_Out1283390214) .cse0 .cse1) (and (= ~x~0_In1283390214 ~x~0_Out1283390214) .cse2))) (and .cse4 .cse5 (= ~x$w_buff0~0_In1283390214 ~x~0_Out1283390214))) (= ~x$r_buff0_thd0~0_Out1283390214 ~x$r_buff0_thd0~0_In1283390214) (or (and .cse3 (= ~x$w_buff0_used~0_Out1283390214 ~x$w_buff0_used~0_In1283390214)) (and .cse4 (= ~x$w_buff0_used~0_Out1283390214 0) .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1283390214, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1283390214, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1283390214|, ~x$w_buff1~0=~x$w_buff1~0_In1283390214, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1283390214, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1283390214, ~x~0=~x~0_In1283390214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1283390214} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1283390214, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1283390214, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1283390214|, ~x$w_buff1~0=~x$w_buff1~0_In1283390214, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1283390214|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1283390214, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1283390214|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1283390214|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1283390214|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1283390214, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1283390214, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1283390214|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1283390214|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1283390214, ~x~0=~x~0_Out1283390214} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:07:59,959 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:07:59,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,961 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:07:59,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,962 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:07:59,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,962 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:07:59,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,962 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:07:59,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,963 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:07:59,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,963 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:07:59,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,964 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:07:59,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,964 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:07:59,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,964 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:07:59,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,965 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:07:59,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,965 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:07:59,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,965 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:07:59,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,966 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:07:59,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,966 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:07:59,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,966 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:07:59,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,968 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:07:59,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,968 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:07:59,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,968 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:07:59,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,972 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:59,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:07:59,973 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:08:00,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:08:00 BasicIcfg [2020-10-16 12:08:00,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:08:00,027 INFO L168 Benchmark]: Toolchain (without parser) took 14763.87 ms. Allocated memory was 139.5 MB in the beginning and 356.5 MB in the end (delta: 217.1 MB). Free memory was 100.5 MB in the beginning and 177.3 MB in the end (delta: -76.8 MB). Peak memory consumption was 140.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:08:00,031 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:08:00,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.93 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.3 MB in the beginning and 155.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:08:00,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.42 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:08:00,032 INFO L168 Benchmark]: Boogie Preprocessor took 37.73 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:08:00,035 INFO L168 Benchmark]: RCFGBuilder took 2066.78 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 149.9 MB in the beginning and 167.2 MB in the end (delta: -17.3 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:08:00,036 INFO L168 Benchmark]: TraceAbstraction took 11854.81 ms. Allocated memory was 248.5 MB in the beginning and 356.5 MB in the end (delta: 108.0 MB). Free memory was 167.2 MB in the beginning and 177.3 MB in the end (delta: -10.1 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:08:00,041 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.93 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.3 MB in the beginning and 155.9 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.42 ms. Allocated memory is still 202.4 MB. Free memory was 155.9 MB in the beginning and 152.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.73 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2066.78 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 149.9 MB in the beginning and 167.2 MB in the end (delta: -17.3 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11854.81 ms. Allocated memory was 248.5 MB in the beginning and 356.5 MB in the end (delta: 108.0 MB). Free memory was 167.2 MB in the beginning and 177.3 MB in the end (delta: -10.1 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 822 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4586 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1888; [L808] FCALL, FORK 0 pthread_create(&t1888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t1889; [L810] FCALL, FORK 0 pthread_create(&t1889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 0 pthread_t t1890; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] FCALL, FORK 0 pthread_create(&t1890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L785] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 366 SDtfs, 294 SDslu, 438 SDs, 0 SdLazy, 259 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 266 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 16309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...