/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-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:25:04,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:25:04,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:25:04,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:25:04,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:25:04,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:25:04,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:25:04,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:25:04,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:25:04,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:25:04,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:25:04,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:25:04,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:25:04,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:25:04,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:25:04,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:25:04,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:25:04,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:25:04,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:25:04,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:25:04,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:25:04,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:25:04,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:25:04,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:25:04,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:25:04,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:25:04,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:25:04,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:25:04,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:25:04,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:25:04,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:25:04,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:25:04,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:25:04,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:25:04,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:25:04,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:25:04,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:25:04,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:25:04,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:25:04,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:25:04,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:25:04,938 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-McrAutomaton-WP.epf [2020-10-16 13:25:04,969 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:25:04,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:25:04,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:25:04,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:25:04,970 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:25:04,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:25:04,971 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:25:04,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:25:04,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:25:04,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:25:04,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:25:04,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:25:04,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:25:04,972 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:25:04,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:25:04,973 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:25:04,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:25:04,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:25:04,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:25:04,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:25:04,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:25:04,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:25:04,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:25:04,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:25:04,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:25:04,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:25:04,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:25:04,975 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:25:04,975 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:25:04,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:25:04,976 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:25:05,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:25:05,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:25:05,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:25:05,340 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:25:05,340 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:25:05,341 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2020-10-16 13:25:05,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3febdd53d/df1c61fc416b46f19363782fa1e9a620/FLAG42bc30b07 [2020-10-16 13:25:05,998 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:25:05,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2020-10-16 13:25:06,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3febdd53d/df1c61fc416b46f19363782fa1e9a620/FLAG42bc30b07 [2020-10-16 13:25:06,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3febdd53d/df1c61fc416b46f19363782fa1e9a620 [2020-10-16 13:25:06,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:25:06,248 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:25:06,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:25:06,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:25:06,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:25:06,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:06" (1/1) ... [2020-10-16 13:25:06,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fa1254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:06, skipping insertion in model container [2020-10-16 13:25:06,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:25:06" (1/1) ... [2020-10-16 13:25:06,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:25:06,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:25:06,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:25:06,858 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:25:06,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:25:07,016 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:25:07,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07 WrapperNode [2020-10-16 13:25:07,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:25:07,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:25:07,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:25:07,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:25:07,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:25:07,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:25:07,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:25:07,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:25:07,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (1/1) ... [2020-10-16 13:25:07,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:25:07,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:25:07,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:25:07,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:25:07,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (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 13:25:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:25:07,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:25:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:25:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:25:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:25:07,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:25:07,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:25:07,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:25:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:25:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:25:07,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:25:07,200 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 13:25:09,355 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:25:09,355 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:25:09,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:09 BoogieIcfgContainer [2020-10-16 13:25:09,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:25:09,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:25:09,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:25:09,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:25:09,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:25:06" (1/3) ... [2020-10-16 13:25:09,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38825f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:09, skipping insertion in model container [2020-10-16 13:25:09,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:25:07" (2/3) ... [2020-10-16 13:25:09,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38825f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:25:09, skipping insertion in model container [2020-10-16 13:25:09,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:25:09" (3/3) ... [2020-10-16 13:25:09,369 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2020-10-16 13:25:09,381 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:25:09,381 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:25:09,390 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:25:09,391 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:25:09,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,423 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,423 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,423 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:25:09,440 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:25:09,454 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 13:25:09,477 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:25:09,478 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:25:09,478 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:25:09,478 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:25:09,478 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:25:09,478 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:25:09,478 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:25:09,479 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:25:09,492 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:25:09,493 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 166 flow [2020-10-16 13:25:09,496 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 166 flow [2020-10-16 13:25:09,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 13:25:09,542 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 13:25:09,542 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:25:09,547 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-16 13:25:09,550 INFO L117 LiptonReduction]: Number of co-enabled transitions 1012 [2020-10-16 13:25:10,143 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:25:11,517 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 13:25:11,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 13:25:11,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:25:11,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 13:25:11,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:25:12,457 WARN L193 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 13:25:14,078 WARN L193 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2020-10-16 13:25:14,457 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-16 13:25:15,110 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 13:25:15,422 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 13:25:16,365 WARN L193 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-10-16 13:25:16,662 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 13:25:17,277 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 13:25:17,654 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 13:25:17,985 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-16 13:25:18,101 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-16 13:25:18,106 INFO L132 LiptonReduction]: Checked pairs total: 3022 [2020-10-16 13:25:18,106 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 13:25:18,113 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 52 flow [2020-10-16 13:25:18,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states. [2020-10-16 13:25:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2020-10-16 13:25:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 13:25:18,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:18,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 13:25:18,146 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash 872957254, now seen corresponding path program 1 times [2020-10-16 13:25:18,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:18,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310078445] [2020-10-16 13:25:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:18,479 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 13:25:18,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310078445] [2020-10-16 13:25:18,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:18,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:25:18,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066525443] [2020-10-16 13:25:18,484 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:18,487 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:18,501 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-16 13:25:18,501 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:18,505 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:25:18,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:25:18,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:25:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:25:18,519 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2020-10-16 13:25:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:18,588 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-16 13:25:18,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:25:18,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 13:25:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:18,609 INFO L225 Difference]: With dead ends: 187 [2020-10-16 13:25:18,609 INFO L226 Difference]: Without dead ends: 152 [2020-10-16 13:25:18,611 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 13:25:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-16 13:25:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-16 13:25:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-16 13:25:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions. [2020-10-16 13:25:18,709 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5 [2020-10-16 13:25:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:18,710 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 357 transitions. [2020-10-16 13:25:18,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:25:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions. [2020-10-16 13:25:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:25:18,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:18,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:18,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:25:18,712 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1393376099, now seen corresponding path program 1 times [2020-10-16 13:25:18,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:18,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723658384] [2020-10-16 13:25:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:18,811 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 13:25:18,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723658384] [2020-10-16 13:25:18,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:18,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:25:18,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856205936] [2020-10-16 13:25:18,813 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:18,814 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:18,817 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:25:18,818 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:18,818 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:25:18,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:25:18,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:25:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:25:18,821 INFO L87 Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 3 states. [2020-10-16 13:25:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:18,850 INFO L93 Difference]: Finished difference Result 147 states and 343 transitions. [2020-10-16 13:25:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:25:18,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:25:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:18,853 INFO L225 Difference]: With dead ends: 147 [2020-10-16 13:25:18,854 INFO L226 Difference]: Without dead ends: 147 [2020-10-16 13:25:18,855 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 13:25:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-16 13:25:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-10-16 13:25:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-16 13:25:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 343 transitions. [2020-10-16 13:25:18,868 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 343 transitions. Word has length 7 [2020-10-16 13:25:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:18,868 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 343 transitions. [2020-10-16 13:25:18,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:25:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 343 transitions. [2020-10-16 13:25:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:25:18,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:18,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:18,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:25:18,870 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:18,870 INFO L82 PathProgramCache]: Analyzing trace with hash 243471209, now seen corresponding path program 1 times [2020-10-16 13:25:18,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:18,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647788192] [2020-10-16 13:25:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:18,955 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 13:25:18,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647788192] [2020-10-16 13:25:18,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:18,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:25:18,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1124326664] [2020-10-16 13:25:18,956 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:18,958 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:18,960 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 10 transitions. [2020-10-16 13:25:18,960 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:18,984 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:25:18,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:25:18,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:25:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:25:18,985 INFO L87 Difference]: Start difference. First operand 147 states and 343 transitions. Second operand 3 states. [2020-10-16 13:25:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:18,993 INFO L93 Difference]: Finished difference Result 132 states and 301 transitions. [2020-10-16 13:25:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:25:18,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-16 13:25:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:18,996 INFO L225 Difference]: With dead ends: 132 [2020-10-16 13:25:18,996 INFO L226 Difference]: Without dead ends: 132 [2020-10-16 13:25:18,997 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 13:25:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-16 13:25:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-16 13:25:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-16 13:25:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 301 transitions. [2020-10-16 13:25:19,006 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 301 transitions. Word has length 8 [2020-10-16 13:25:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:19,006 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 301 transitions. [2020-10-16 13:25:19,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:25:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 301 transitions. [2020-10-16 13:25:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:25:19,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:19,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:19,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:25:19,008 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -950197978, now seen corresponding path program 1 times [2020-10-16 13:25:19,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:19,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428637734] [2020-10-16 13:25:19,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:19,282 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 13:25:19,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428637734] [2020-10-16 13:25:19,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:19,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:25:19,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238742716] [2020-10-16 13:25:19,284 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:19,286 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:19,288 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2020-10-16 13:25:19,289 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:19,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,330 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:19,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,351 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:25:19,357 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:19,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,425 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:19,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:19,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,465 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:19,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,482 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:19,486 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:25:19,488 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:25:19,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:19,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:19,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:19,565 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:19,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:19,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:19,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:19,601 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1853#(and (= ~y~0 1) (<= ~x~0 0) (= (mod ~x$r_buff0_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0))] [2020-10-16 13:25:19,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:25:19,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:19,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:25:19,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:25:19,602 INFO L87 Difference]: Start difference. First operand 132 states and 301 transitions. Second operand 7 states. [2020-10-16 13:25:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:19,722 INFO L93 Difference]: Finished difference Result 139 states and 319 transitions. [2020-10-16 13:25:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:25:19,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-16 13:25:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:19,726 INFO L225 Difference]: With dead ends: 139 [2020-10-16 13:25:19,726 INFO L226 Difference]: Without dead ends: 139 [2020-10-16 13:25:19,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:25:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-16 13:25:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2020-10-16 13:25:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-16 13:25:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 295 transitions. [2020-10-16 13:25:19,736 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 295 transitions. Word has length 11 [2020-10-16 13:25:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:19,736 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 295 transitions. [2020-10-16 13:25:19,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:25:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 295 transitions. [2020-10-16 13:25:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:25:19,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:19,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:19,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:25:19,738 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash 608632615, now seen corresponding path program 1 times [2020-10-16 13:25:19,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:19,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903759492] [2020-10-16 13:25:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:25:19,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903759492] [2020-10-16 13:25:19,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:19,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:25:19,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1005518012] [2020-10-16 13:25:19,804 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:19,806 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:19,810 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 26 transitions. [2020-10-16 13:25:19,810 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:19,835 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:25:19,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:25:19,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:25:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:25:19,837 INFO L87 Difference]: Start difference. First operand 130 states and 295 transitions. Second operand 3 states. [2020-10-16 13:25:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:19,854 INFO L93 Difference]: Finished difference Result 188 states and 423 transitions. [2020-10-16 13:25:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:25:19,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 13:25:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:19,856 INFO L225 Difference]: With dead ends: 188 [2020-10-16 13:25:19,856 INFO L226 Difference]: Without dead ends: 96 [2020-10-16 13:25:19,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 13:25:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-10-16 13:25:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-10-16 13:25:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-16 13:25:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 210 transitions. [2020-10-16 13:25:19,861 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 210 transitions. Word has length 12 [2020-10-16 13:25:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:19,862 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 210 transitions. [2020-10-16 13:25:19,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:25:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 210 transitions. [2020-10-16 13:25:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:25:19,863 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:19,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:19,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:25:19,864 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1687741796, now seen corresponding path program 1 times [2020-10-16 13:25:19,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:19,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586040509] [2020-10-16 13:25:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:25:19,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586040509] [2020-10-16 13:25:19,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:19,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:25:19,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798536281] [2020-10-16 13:25:19,994 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:19,996 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:20,002 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2020-10-16 13:25:20,002 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:20,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,095 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2642#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-16 13:25:20,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:25:20,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:25:20,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:25:20,096 INFO L87 Difference]: Start difference. First operand 96 states and 210 transitions. Second operand 5 states. [2020-10-16 13:25:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:20,158 INFO L93 Difference]: Finished difference Result 61 states and 117 transitions. [2020-10-16 13:25:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:25:20,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 13:25:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:20,159 INFO L225 Difference]: With dead ends: 61 [2020-10-16 13:25:20,160 INFO L226 Difference]: Without dead ends: 34 [2020-10-16 13:25:20,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:25:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-16 13:25:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-16 13:25:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-16 13:25:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2020-10-16 13:25:20,163 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 13 [2020-10-16 13:25:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:20,164 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2020-10-16 13:25:20,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:25:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-10-16 13:25:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:25:20,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:20,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:20,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:25:20,165 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:20,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1918077124, now seen corresponding path program 1 times [2020-10-16 13:25:20,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:20,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120491023] [2020-10-16 13:25:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:25:20,619 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 13:25:20,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120491023] [2020-10-16 13:25:20,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:25:20,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:25:20,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304141610] [2020-10-16 13:25:20,620 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:25:20,624 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:25:20,630 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 32 transitions. [2020-10-16 13:25:20,631 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:25:20,660 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-16 13:25:20,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:25:20,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:25:20,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:25:20,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:25:20,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-16 13:25:20,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,718 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:25:20,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,731 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,762 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,777 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:25:20,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,826 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:25:20,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,831 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:20,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,846 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,855 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 13:25:20,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,865 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:25:20,884 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:20,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:25:20,895 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:25:20,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:25:20,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:25:20,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 13:25:20,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:25:21,075 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-10-16 13:25:21,077 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2784#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= ~x$w_buff0_used~0 0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (not (= 2 ~x$w_buff1~0)))] [2020-10-16 13:25:21,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 13:25:21,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:25:21,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 13:25:21,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:25:21,079 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 9 states. [2020-10-16 13:25:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:25:21,215 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-10-16 13:25:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 13:25:21,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-10-16 13:25:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:25:21,217 INFO L225 Difference]: With dead ends: 42 [2020-10-16 13:25:21,217 INFO L226 Difference]: Without dead ends: 30 [2020-10-16 13:25:21,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:25:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-16 13:25:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-16 13:25:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-16 13:25:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-10-16 13:25:21,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 17 [2020-10-16 13:25:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:25:21,220 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-10-16 13:25:21,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 13:25:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-10-16 13:25:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:25:21,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:25:21,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:25:21,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:25:21,222 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:25:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:25:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash 483918532, now seen corresponding path program 2 times [2020-10-16 13:25:21,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:25:21,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415699996] [2020-10-16 13:25:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:25:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:25:21,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:25:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:25:21,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:25:21,444 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:25:21,444 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:25:21,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:25:21,445 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:25:21,454 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L2-->L803: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In993287492 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In993287492 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In993287492 256) 0)) (.cse8 (= 0 (mod ~x$r_buff1_thd0~0_In993287492 256)))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out993287492 0)) (and .cse2 (= ~x$w_buff1_used~0_Out993287492 ~x$w_buff1_used~0_In993287492))) (= ~x$r_buff1_thd0~0_In993287492 ~x$r_buff1_thd0~0_Out993287492) (or (and .cse3 (or (and .cse2 (= ~x~0_Out993287492 ~x~0_In993287492)) (and .cse0 .cse1 (= ~x$w_buff1~0_In993287492 ~x~0_Out993287492)))) (and (= ~x~0_Out993287492 ~x$w_buff0~0_In993287492) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out993287492 0)) (= ~x$r_buff0_thd0~0_In993287492 ~x$r_buff0_thd0~0_Out993287492) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In993287492| ULTIMATE.start_assume_abort_if_not_~cond_Out993287492) (or (and (= ~x$w_buff0_used~0_Out993287492 ~x$w_buff0_used~0_In993287492) .cse3) (and .cse4 (= ~x$w_buff0_used~0_Out993287492 0) .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In993287492, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In993287492, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In993287492|, ~x$w_buff1~0=~x$w_buff1~0_In993287492, ~x$w_buff1_used~0=~x$w_buff1_used~0_In993287492, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In993287492, ~x~0=~x~0_In993287492, ~x$w_buff0_used~0=~x$w_buff0_used~0_In993287492} OutVars{~x$w_buff0~0=~x$w_buff0~0_In993287492, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out993287492, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out993287492|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out993287492|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out993287492|, ~x$w_buff1~0=~x$w_buff1~0_In993287492, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out993287492, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out993287492|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out993287492, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out993287492|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out993287492|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out993287492, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In993287492|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out993287492, ~x~0=~x~0_Out993287492} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 13:25:21,458 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 13:25:21,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,459 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 13:25:21,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,460 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 13:25:21,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,460 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 13:25:21,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,460 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 13:25:21,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,461 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 13:25:21,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,461 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 13:25:21,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,462 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 13:25:21,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,462 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 13:25:21,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,463 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 13:25:21,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,463 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 13:25:21,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,463 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 13:25:21,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,464 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 13:25:21,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,464 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 13:25:21,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,465 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 13:25:21,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,465 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 13:25:21,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,466 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 13:25:21,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,466 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 13:25:21,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,466 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 13:25:21,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,467 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 13:25:21,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,467 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 13:25:21,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,467 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 13:25:21,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,468 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 13:25:21,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,468 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 13:25:21,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,468 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 13:25:21,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,468 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 13:25:21,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:25:21,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:25:21 BasicIcfg [2020-10-16 13:25:21,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:25:21,518 INFO L168 Benchmark]: Toolchain (without parser) took 15270.12 ms. Allocated memory was 140.0 MB in the beginning and 364.4 MB in the end (delta: 224.4 MB). Free memory was 101.5 MB in the beginning and 277.9 MB in the end (delta: -176.4 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:25:21,519 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:25:21,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.45 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 156.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-10-16 13:25:21,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:25:21,521 INFO L168 Benchmark]: Boogie Preprocessor took 43.01 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:25:21,522 INFO L168 Benchmark]: RCFGBuilder took 2226.04 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 151.0 MB in the beginning and 197.6 MB in the end (delta: -46.6 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:25:21,523 INFO L168 Benchmark]: TraceAbstraction took 12156.04 ms. Allocated memory was 248.5 MB in the beginning and 364.4 MB in the end (delta: 115.9 MB). Free memory was 197.6 MB in the beginning and 277.9 MB in the end (delta: -80.3 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:25:21,528 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.20 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.45 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 156.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.01 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2226.04 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 151.0 MB in the beginning and 197.6 MB in the end (delta: -46.6 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12156.04 ms. Allocated memory was 248.5 MB in the beginning and 364.4 MB in the end (delta: 115.9 MB). Free memory was 197.6 MB in the beginning and 277.9 MB in the end (delta: -80.3 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 515 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 34 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 83 PlacesBefore, 28 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 3022 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L706] 0 _Bool x$flush_delayed; [L707] 0 int x$mem_tmp; [L708] 0 _Bool x$r_buff0_thd0; [L709] 0 _Bool x$r_buff0_thd1; [L710] 0 _Bool x$r_buff0_thd2; [L711] 0 _Bool x$r_buff1_thd0; [L712] 0 _Bool x$r_buff1_thd1; [L713] 0 _Bool x$r_buff1_thd2; [L714] 0 _Bool x$read_delayed; [L715] 0 int *x$read_delayed_var; [L716] 0 int x$w_buff0; [L717] 0 _Bool x$w_buff0_used; [L718] 0 int x$w_buff1; [L719] 0 _Bool x$w_buff1_used; [L721] 0 int y = 0; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L789] 0 pthread_t t1591; [L790] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L791] 0 pthread_t t1592; [L792] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L747] 2 x$w_buff1 = x$w_buff0 [L748] 2 x$w_buff0 = 2 [L749] 2 x$w_buff1_used = x$w_buff0_used [L750] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L764] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L727] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] 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) [L733] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L733] 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) [L733] 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) [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 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 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L737] 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 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L767] 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) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] 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) [L767] 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) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 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 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 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 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L805] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 0 x$flush_delayed = weak$$choice2 [L808] 0 x$mem_tmp = x [L809] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L809] 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) [L809] 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) [L810] 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)) [L810] 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) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L810] 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) [L810] 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)) [L810] 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)) [L811] 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)) [L811] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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) [L815] 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)) [L815] 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)) [L816] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L817] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L817] 0 x = x$flush_delayed ? x$mem_tmp : x [L818] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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 3 procedures, 77 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 119 SDtfs, 89 SDslu, 137 SDs, 0 SdLazy, 110 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 8532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...