/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:06:32,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:06:32,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:06:32,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:06:32,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:06:32,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:06:32,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:06:32,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:06:32,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:06:32,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:06:32,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:06:32,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:06:32,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:06:32,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:06:32,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:06:32,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:06:32,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:06:32,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:06:32,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:06:32,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:06:32,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:06:32,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:06:32,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:06:32,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:06:32,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:06:32,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:06:32,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:06:32,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:06:32,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:06:32,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:06:32,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:06:32,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:06:32,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:06:32,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:06:32,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:06:32,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:06:32,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:06:32,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:06:32,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:06:32,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:06:32,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:06:32,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:06:32,917 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:06:32,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:06:32,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:06:32,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:06:32,919 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:06:32,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:06:32,920 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:06:32,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:06:32,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:06:32,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:06:32,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:06:32,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:06:32,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:06:32,921 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:06:32,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:06:32,921 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:06:32,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:06:32,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:06:32,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:06:32,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:06:32,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:06:32,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:06:32,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:06:32,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:06:32,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:06:32,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:06:32,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:06:32,924 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:06:32,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:06:33,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:06:33,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:06:33,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:06:33,217 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:06:33,218 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:06:33,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2020-10-21 23:06:33,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c66d9e5/f0d52c80f4604347ad48ac4079d881ac/FLAGc0c063b2f [2020-10-21 23:06:33,849 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:06:33,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2020-10-21 23:06:33,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c66d9e5/f0d52c80f4604347ad48ac4079d881ac/FLAGc0c063b2f [2020-10-21 23:06:34,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28c66d9e5/f0d52c80f4604347ad48ac4079d881ac [2020-10-21 23:06:34,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:06:34,067 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:06:34,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:06:34,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:06:34,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:06:34,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422f0864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34, skipping insertion in model container [2020-10-21 23:06:34,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:06:34,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:06:34,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:06:34,627 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:06:34,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:06:34,803 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:06:34,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34 WrapperNode [2020-10-21 23:06:34,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:06:34,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:06:34,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:06:34,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:06:34,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:06:34,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:06:34,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:06:34,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:06:34,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... [2020-10-21 23:06:34,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:06:34,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:06:34,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:06:34,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:06:34,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:06:34,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:06:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:06:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:06:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:06:34,990 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:06:34,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:06:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:06:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:06:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:06:34,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:06:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:06:34,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:06:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:06:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:06:34,994 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:06:37,059 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:06:37,060 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:06:37,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:06:37 BoogieIcfgContainer [2020-10-21 23:06:37,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:06:37,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:06:37,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:06:37,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:06:37,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:06:34" (1/3) ... [2020-10-21 23:06:37,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c6bc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:06:37, skipping insertion in model container [2020-10-21 23:06:37,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:06:34" (2/3) ... [2020-10-21 23:06:37,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c6bc18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:06:37, skipping insertion in model container [2020-10-21 23:06:37,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:06:37" (3/3) ... [2020-10-21 23:06:37,071 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2020-10-21 23:06:37,083 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:06:37,083 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:06:37,091 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:06:37,092 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:06:37,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,122 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,123 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,124 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,139 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,139 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,147 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,148 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,149 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,150 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:06:37,151 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:06:37,166 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:06:37,188 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:06:37,188 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:06:37,188 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:06:37,188 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:06:37,189 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:06:37,189 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:06:37,189 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:06:37,189 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:06:37,204 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:06:37,205 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-21 23:06:37,208 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-10-21 23:06:37,210 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-10-21 23:06:37,258 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-10-21 23:06:37,259 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:06:37,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-21 23:06:37,267 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-10-21 23:06:37,721 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-21 23:06:39,401 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-21 23:06:39,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 23:06:39,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:06:39,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 23:06:39,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:06:40,614 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-21 23:06:40,938 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:06:41,682 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-21 23:06:42,417 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-21 23:06:43,001 WARN L193 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-10-21 23:06:44,466 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 139 DAG size of output: 129 [2020-10-21 23:06:44,840 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-21 23:06:45,312 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-21 23:06:45,484 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-21 23:06:45,511 INFO L131 LiptonReduction]: Checked pairs total: 4422 [2020-10-21 23:06:45,511 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-10-21 23:06:45,519 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-21 23:06:45,559 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-21 23:06:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-21 23:06:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 23:06:45,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:45,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 23:06:45,570 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times [2020-10-21 23:06:45,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:45,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300170236] [2020-10-21 23:06:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:45,801 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-21 23:06:45,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300170236] [2020-10-21 23:06:45,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:45,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:06:45,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041972720] [2020-10-21 23:06:45,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:06:45,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:45,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:06:45,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:45,827 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-21 23:06:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:45,979 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-21 23:06:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:06:45,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 23:06:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:46,008 INFO L225 Difference]: With dead ends: 552 [2020-10-21 23:06:46,009 INFO L226 Difference]: Without dead ends: 452 [2020-10-21 23:06:46,010 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-21 23:06:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-21 23:06:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-21 23:06:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-21 23:06:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-21 23:06:46,101 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-21 23:06:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:46,102 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-21 23:06:46,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:06:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-21 23:06:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:06:46,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:46,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:46,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:06:46,106 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times [2020-10-21 23:06:46,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:46,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620902617] [2020-10-21 23:06:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:46,300 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-21 23:06:46,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620902617] [2020-10-21 23:06:46,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:46,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:06:46,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484751593] [2020-10-21 23:06:46,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:06:46,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:46,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:06:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:46,304 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-21 23:06:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:46,346 INFO L93 Difference]: Finished difference Result 447 states and 1343 transitions. [2020-10-21 23:06:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:06:46,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:06:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:46,353 INFO L225 Difference]: With dead ends: 447 [2020-10-21 23:06:46,354 INFO L226 Difference]: Without dead ends: 447 [2020-10-21 23:06:46,355 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-21 23:06:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-10-21 23:06:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2020-10-21 23:06:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-10-21 23:06:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1343 transitions. [2020-10-21 23:06:46,400 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1343 transitions. Word has length 9 [2020-10-21 23:06:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:46,400 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 1343 transitions. [2020-10-21 23:06:46,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:06:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1343 transitions. [2020-10-21 23:06:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:06:46,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:46,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:46,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:06:46,403 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash 528518820, now seen corresponding path program 1 times [2020-10-21 23:06:46,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:46,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139904741] [2020-10-21 23:06:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:06:46,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139904741] [2020-10-21 23:06:46,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:46,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:06:46,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987967756] [2020-10-21 23:06:46,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:06:46,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:06:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:06:46,511 INFO L87 Difference]: Start difference. First operand 447 states and 1343 transitions. Second operand 3 states. [2020-10-21 23:06:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:46,524 INFO L93 Difference]: Finished difference Result 428 states and 1276 transitions. [2020-10-21 23:06:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:06:46,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:06:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:46,529 INFO L225 Difference]: With dead ends: 428 [2020-10-21 23:06:46,529 INFO L226 Difference]: Without dead ends: 428 [2020-10-21 23:06:46,530 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-21 23:06:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-10-21 23:06:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2020-10-21 23:06:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-10-21 23:06:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1276 transitions. [2020-10-21 23:06:46,547 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1276 transitions. Word has length 10 [2020-10-21 23:06:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:46,553 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 1276 transitions. [2020-10-21 23:06:46,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:06:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1276 transitions. [2020-10-21 23:06:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:06:46,563 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:46,563 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:46,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:06:46,564 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash -795853152, now seen corresponding path program 1 times [2020-10-21 23:06:46,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:46,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291731141] [2020-10-21 23:06:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:46,711 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-21 23:06:46,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291731141] [2020-10-21 23:06:46,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:46,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:06:46,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78823008] [2020-10-21 23:06:46,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:46,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:46,713 INFO L87 Difference]: Start difference. First operand 428 states and 1276 transitions. Second operand 4 states. [2020-10-21 23:06:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:46,748 INFO L93 Difference]: Finished difference Result 640 states and 1891 transitions. [2020-10-21 23:06:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:46,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:06:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:46,752 INFO L225 Difference]: With dead ends: 640 [2020-10-21 23:06:46,752 INFO L226 Difference]: Without dead ends: 400 [2020-10-21 23:06:46,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-10-21 23:06:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2020-10-21 23:06:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-21 23:06:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1173 transitions. [2020-10-21 23:06:46,768 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1173 transitions. Word has length 11 [2020-10-21 23:06:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:46,768 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1173 transitions. [2020-10-21 23:06:46,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1173 transitions. [2020-10-21 23:06:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:06:46,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:46,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:46,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:06:46,771 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times [2020-10-21 23:06:46,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:46,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672849841] [2020-10-21 23:06:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:46,853 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-21 23:06:46,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672849841] [2020-10-21 23:06:46,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:46,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:06:46,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366631449] [2020-10-21 23:06:46,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:46,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:46,855 INFO L87 Difference]: Start difference. First operand 400 states and 1173 transitions. Second operand 4 states. [2020-10-21 23:06:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:46,922 INFO L93 Difference]: Finished difference Result 426 states and 1246 transitions. [2020-10-21 23:06:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:46,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:06:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:46,927 INFO L225 Difference]: With dead ends: 426 [2020-10-21 23:06:46,927 INFO L226 Difference]: Without dead ends: 426 [2020-10-21 23:06:46,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-21 23:06:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-21 23:06:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-21 23:06:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1246 transitions. [2020-10-21 23:06:46,944 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1246 transitions. Word has length 11 [2020-10-21 23:06:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:46,944 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1246 transitions. [2020-10-21 23:06:46,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1246 transitions. [2020-10-21 23:06:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:06:46,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:46,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:46,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:06:46,950 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times [2020-10-21 23:06:46,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:46,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801057681] [2020-10-21 23:06:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:47,101 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-21 23:06:47,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801057681] [2020-10-21 23:06:47,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:47,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:06:47,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706602515] [2020-10-21 23:06:47,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:06:47,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:47,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:06:47,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:47,103 INFO L87 Difference]: Start difference. First operand 426 states and 1246 transitions. Second operand 5 states. [2020-10-21 23:06:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:47,223 INFO L93 Difference]: Finished difference Result 424 states and 1238 transitions. [2020-10-21 23:06:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:47,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:06:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:47,228 INFO L225 Difference]: With dead ends: 424 [2020-10-21 23:06:47,228 INFO L226 Difference]: Without dead ends: 424 [2020-10-21 23:06:47,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:47,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-21 23:06:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 417. [2020-10-21 23:06:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-10-21 23:06:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1216 transitions. [2020-10-21 23:06:47,245 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1216 transitions. Word has length 12 [2020-10-21 23:06:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:47,246 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 1216 transitions. [2020-10-21 23:06:47,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:06:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1216 transitions. [2020-10-21 23:06:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:47,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:47,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:47,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:06:47,248 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times [2020-10-21 23:06:47,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:47,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317680400] [2020-10-21 23:06:47,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:47,491 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-21 23:06:47,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317680400] [2020-10-21 23:06:47,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:47,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:47,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990916644] [2020-10-21 23:06:47,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:47,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:47,494 INFO L87 Difference]: Start difference. First operand 417 states and 1216 transitions. Second operand 6 states. [2020-10-21 23:06:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:47,636 INFO L93 Difference]: Finished difference Result 436 states and 1277 transitions. [2020-10-21 23:06:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:47,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:47,641 INFO L225 Difference]: With dead ends: 436 [2020-10-21 23:06:47,641 INFO L226 Difference]: Without dead ends: 436 [2020-10-21 23:06:47,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-10-21 23:06:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 430. [2020-10-21 23:06:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-21 23:06:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1258 transitions. [2020-10-21 23:06:47,657 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1258 transitions. Word has length 13 [2020-10-21 23:06:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:47,658 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1258 transitions. [2020-10-21 23:06:47,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1258 transitions. [2020-10-21 23:06:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:47,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:47,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:47,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:06:47,660 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash -337816853, now seen corresponding path program 1 times [2020-10-21 23:06:47,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:47,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104022940] [2020-10-21 23:06:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:47,744 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-21 23:06:47,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104022940] [2020-10-21 23:06:47,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:47,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:47,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871231162] [2020-10-21 23:06:47,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:47,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:47,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:47,747 INFO L87 Difference]: Start difference. First operand 430 states and 1258 transitions. Second operand 6 states. [2020-10-21 23:06:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:47,901 INFO L93 Difference]: Finished difference Result 839 states and 2365 transitions. [2020-10-21 23:06:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:06:47,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:47,905 INFO L225 Difference]: With dead ends: 839 [2020-10-21 23:06:47,905 INFO L226 Difference]: Without dead ends: 391 [2020-10-21 23:06:47,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:06:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-10-21 23:06:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 365. [2020-10-21 23:06:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-10-21 23:06:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 969 transitions. [2020-10-21 23:06:47,917 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 969 transitions. Word has length 13 [2020-10-21 23:06:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:47,918 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 969 transitions. [2020-10-21 23:06:47,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 969 transitions. [2020-10-21 23:06:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:47,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:47,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:47,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:06:47,920 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:47,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash 216590530, now seen corresponding path program 1 times [2020-10-21 23:06:47,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:47,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090356025] [2020-10-21 23:06:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:48,001 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-21 23:06:48,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090356025] [2020-10-21 23:06:48,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:48,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:48,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821242058] [2020-10-21 23:06:48,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:48,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:48,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:48,003 INFO L87 Difference]: Start difference. First operand 365 states and 969 transitions. Second operand 6 states. [2020-10-21 23:06:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:48,102 INFO L93 Difference]: Finished difference Result 379 states and 1006 transitions. [2020-10-21 23:06:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:48,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:48,107 INFO L225 Difference]: With dead ends: 379 [2020-10-21 23:06:48,107 INFO L226 Difference]: Without dead ends: 379 [2020-10-21 23:06:48,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-21 23:06:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 370. [2020-10-21 23:06:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-10-21 23:06:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 985 transitions. [2020-10-21 23:06:48,119 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 985 transitions. Word has length 13 [2020-10-21 23:06:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:48,119 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 985 transitions. [2020-10-21 23:06:48,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 985 transitions. [2020-10-21 23:06:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:06:48,120 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:48,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:48,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:06:48,121 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash 216637030, now seen corresponding path program 2 times [2020-10-21 23:06:48,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:48,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286528086] [2020-10-21 23:06:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:48,239 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-21 23:06:48,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286528086] [2020-10-21 23:06:48,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:48,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:48,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656729375] [2020-10-21 23:06:48,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:48,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:48,242 INFO L87 Difference]: Start difference. First operand 370 states and 985 transitions. Second operand 6 states. [2020-10-21 23:06:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:48,384 INFO L93 Difference]: Finished difference Result 400 states and 1042 transitions. [2020-10-21 23:06:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:48,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:06:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:48,389 INFO L225 Difference]: With dead ends: 400 [2020-10-21 23:06:48,389 INFO L226 Difference]: Without dead ends: 376 [2020-10-21 23:06:48,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:06:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-21 23:06:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 338. [2020-10-21 23:06:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-21 23:06:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 891 transitions. [2020-10-21 23:06:48,400 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 891 transitions. Word has length 13 [2020-10-21 23:06:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:48,401 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 891 transitions. [2020-10-21 23:06:48,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 891 transitions. [2020-10-21 23:06:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:06:48,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:48,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:48,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:06:48,402 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times [2020-10-21 23:06:48,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:48,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555523682] [2020-10-21 23:06:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:48,582 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-21 23:06:48,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555523682] [2020-10-21 23:06:48,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:48,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:48,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243698355] [2020-10-21 23:06:48,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:48,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:48,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:48,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:48,584 INFO L87 Difference]: Start difference. First operand 338 states and 891 transitions. Second operand 6 states. [2020-10-21 23:06:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:48,691 INFO L93 Difference]: Finished difference Result 358 states and 941 transitions. [2020-10-21 23:06:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:06:48,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:06:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:48,696 INFO L225 Difference]: With dead ends: 358 [2020-10-21 23:06:48,696 INFO L226 Difference]: Without dead ends: 358 [2020-10-21 23:06:48,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-10-21 23:06:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2020-10-21 23:06:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-10-21 23:06:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 896 transitions. [2020-10-21 23:06:48,712 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 896 transitions. Word has length 14 [2020-10-21 23:06:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:48,712 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 896 transitions. [2020-10-21 23:06:48,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 896 transitions. [2020-10-21 23:06:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:06:48,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:48,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:48,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:06:48,714 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:48,715 INFO L82 PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times [2020-10-21 23:06:48,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:48,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204008674] [2020-10-21 23:06:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:48,974 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-21 23:06:48,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204008674] [2020-10-21 23:06:48,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:48,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:06:48,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297383893] [2020-10-21 23:06:48,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:06:48,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:06:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:48,976 INFO L87 Difference]: Start difference. First operand 340 states and 896 transitions. Second operand 7 states. [2020-10-21 23:06:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:49,158 INFO L93 Difference]: Finished difference Result 444 states and 1128 transitions. [2020-10-21 23:06:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:06:49,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-21 23:06:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:49,163 INFO L225 Difference]: With dead ends: 444 [2020-10-21 23:06:49,163 INFO L226 Difference]: Without dead ends: 352 [2020-10-21 23:06:49,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:06:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-10-21 23:06:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 328. [2020-10-21 23:06:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-10-21 23:06:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 844 transitions. [2020-10-21 23:06:49,177 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 844 transitions. Word has length 14 [2020-10-21 23:06:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:49,177 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 844 transitions. [2020-10-21 23:06:49,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:06:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 844 transitions. [2020-10-21 23:06:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:06:49,178 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:49,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:49,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:06:49,179 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 1 times [2020-10-21 23:06:49,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:49,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921184098] [2020-10-21 23:06:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:49,265 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-21 23:06:49,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921184098] [2020-10-21 23:06:49,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:49,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:06:49,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850841155] [2020-10-21 23:06:49,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:06:49,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:06:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:06:49,268 INFO L87 Difference]: Start difference. First operand 328 states and 844 transitions. Second operand 4 states. [2020-10-21 23:06:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:49,301 INFO L93 Difference]: Finished difference Result 332 states and 756 transitions. [2020-10-21 23:06:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:49,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:06:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:49,303 INFO L225 Difference]: With dead ends: 332 [2020-10-21 23:06:49,303 INFO L226 Difference]: Without dead ends: 248 [2020-10-21 23:06:49,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-10-21 23:06:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2020-10-21 23:06:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-21 23:06:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 558 transitions. [2020-10-21 23:06:49,311 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 558 transitions. Word has length 14 [2020-10-21 23:06:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:49,312 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 558 transitions. [2020-10-21 23:06:49,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:06:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 558 transitions. [2020-10-21 23:06:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:06:49,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:49,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:49,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:06:49,313 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:49,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1637663200, now seen corresponding path program 1 times [2020-10-21 23:06:49,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:49,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639904374] [2020-10-21 23:06:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:49,371 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-21 23:06:49,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639904374] [2020-10-21 23:06:49,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:49,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:06:49,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660809959] [2020-10-21 23:06:49,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:06:49,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:06:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:06:49,374 INFO L87 Difference]: Start difference. First operand 248 states and 558 transitions. Second operand 5 states. [2020-10-21 23:06:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:49,418 INFO L93 Difference]: Finished difference Result 211 states and 427 transitions. [2020-10-21 23:06:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:06:49,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:06:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:49,420 INFO L225 Difference]: With dead ends: 211 [2020-10-21 23:06:49,420 INFO L226 Difference]: Without dead ends: 163 [2020-10-21 23:06:49,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-21 23:06:49,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-10-21 23:06:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-21 23:06:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 321 transitions. [2020-10-21 23:06:49,426 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 321 transitions. Word has length 15 [2020-10-21 23:06:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:49,426 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 321 transitions. [2020-10-21 23:06:49,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:06:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 321 transitions. [2020-10-21 23:06:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:06:49,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:49,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:49,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:06:49,428 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:49,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times [2020-10-21 23:06:49,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:49,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763007939] [2020-10-21 23:06:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:49,703 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-21 23:06:49,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763007939] [2020-10-21 23:06:49,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:49,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:06:49,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677806001] [2020-10-21 23:06:49,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:06:49,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:06:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:06:49,706 INFO L87 Difference]: Start difference. First operand 163 states and 321 transitions. Second operand 8 states. [2020-10-21 23:06:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:49,849 INFO L93 Difference]: Finished difference Result 180 states and 345 transitions. [2020-10-21 23:06:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:06:49,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-21 23:06:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:49,851 INFO L225 Difference]: With dead ends: 180 [2020-10-21 23:06:49,852 INFO L226 Difference]: Without dead ends: 126 [2020-10-21 23:06:49,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:06:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-21 23:06:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2020-10-21 23:06:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-21 23:06:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 228 transitions. [2020-10-21 23:06:49,856 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 228 transitions. Word has length 17 [2020-10-21 23:06:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:49,856 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 228 transitions. [2020-10-21 23:06:49,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:06:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 228 transitions. [2020-10-21 23:06:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:06:49,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:49,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:49,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:06:49,858 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times [2020-10-21 23:06:49,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:49,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708605592] [2020-10-21 23:06:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:06:49,933 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-21 23:06:49,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708605592] [2020-10-21 23:06:49,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:06:49,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:06:49,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341151192] [2020-10-21 23:06:49,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:06:49,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:06:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:06:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:06:49,935 INFO L87 Difference]: Start difference. First operand 115 states and 228 transitions. Second operand 6 states. [2020-10-21 23:06:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:06:49,982 INFO L93 Difference]: Finished difference Result 102 states and 201 transitions. [2020-10-21 23:06:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:06:49,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-21 23:06:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:06:49,983 INFO L225 Difference]: With dead ends: 102 [2020-10-21 23:06:49,983 INFO L226 Difference]: Without dead ends: 59 [2020-10-21 23:06:49,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:06:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-21 23:06:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-21 23:06:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-21 23:06:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2020-10-21 23:06:49,986 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 17 [2020-10-21 23:06:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:06:49,986 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2020-10-21 23:06:49,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:06:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2020-10-21 23:06:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:06:49,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:06:49,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:06:49,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:06:49,987 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:06:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:06:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times [2020-10-21 23:06:49,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:06:49,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369956027] [2020-10-21 23:06:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:06:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:06:50,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:06:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:06:50,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:06:50,139 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:06:50,140 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:06:50,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:06:50,142 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:06:50,157 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse7 (= 0 (mod ~y$r_buff0_thd0~0_In1429595337 256))) (.cse6 (= (mod ~y$w_buff0_used~0_In1429595337 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In1429595337 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In1429595337 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_In1429595337 ~y$r_buff0_thd0~0_Out1429595337) (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_Out1429595337 0)) (and .cse2 (= ~y$w_buff1_used~0_Out1429595337 ~y$w_buff1_used~0_In1429595337))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1429595337 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1429595337 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1429595337|) (or (and (or (and .cse0 (= ~y$w_buff1~0_In1429595337 ~y~0_Out1429595337) .cse1) (and .cse2 (= ~y~0_In1429595337 ~y~0_Out1429595337))) .cse3) (and .cse4 .cse5 (= ~y$w_buff0~0_In1429595337 ~y~0_Out1429595337))) (or (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out1429595337 0)) (and (= ~y$w_buff0_used~0_Out1429595337 ~y$w_buff0_used~0_In1429595337) .cse3)) (= ~y$r_buff1_thd0~0_In1429595337 ~y$r_buff1_thd0~0_Out1429595337)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1429595337|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1429595337, ~y$w_buff1~0=~y$w_buff1~0_In1429595337, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1429595337, ~y$w_buff0~0=~y$w_buff0~0_In1429595337, ~y~0=~y~0_In1429595337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1429595337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1429595337} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1429595337, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1429595337|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1429595337|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1429595337|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1429595337|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1429595337|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1429595337|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1429595337|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1429595337, ~y$w_buff1~0=~y$w_buff1~0_In1429595337, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1429595337, ~y$w_buff0~0=~y$w_buff0~0_In1429595337, ~y~0=~y~0_Out1429595337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1429595337, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1429595337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 23:06:50,163 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,164 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-10-21 23:06:50,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,171 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:06:50,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,175 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-21 23:06:50,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,176 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-21 23:06:50,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,176 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-21 23:06:50,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,176 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-21 23:06:50,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,177 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-21 23:06:50,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,177 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-21 23:06:50,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,179 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-21 23:06:50,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,183 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-21 23:06:50,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,183 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-21 23:06:50,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,184 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-21 23:06:50,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,184 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-21 23:06:50,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,184 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-21 23:06:50,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,185 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-21 23:06:50,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,185 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-21 23:06:50,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,185 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-21 23:06:50,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,186 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-21 23:06:50,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,186 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-21 23:06:50,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,186 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-21 23:06:50,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,186 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-21 23:06:50,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:06:50,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:06:50 BasicIcfg [2020-10-21 23:06:50,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:06:50,257 INFO L168 Benchmark]: Toolchain (without parser) took 16195.39 ms. Allocated memory was 142.1 MB in the beginning and 398.5 MB in the end (delta: 256.4 MB). Free memory was 101.7 MB in the beginning and 267.3 MB in the end (delta: -165.6 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,257 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 736.23 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 158.1 MB in the end (delta: -57.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.64 ms. Allocated memory is still 205.5 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,259 INFO L168 Benchmark]: Boogie Preprocessor took 42.54 ms. Allocated memory is still 205.5 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,260 INFO L168 Benchmark]: RCFGBuilder took 2138.70 ms. Allocated memory was 205.5 MB in the beginning and 245.4 MB in the end (delta: 39.8 MB). Free memory was 152.3 MB in the beginning and 156.0 MB in the end (delta: -3.7 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,261 INFO L168 Benchmark]: TraceAbstraction took 13191.52 ms. Allocated memory was 245.4 MB in the beginning and 398.5 MB in the end (delta: 153.1 MB). Free memory was 156.0 MB in the beginning and 267.3 MB in the end (delta: -111.3 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:06:50,264 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 736.23 ms. Allocated memory was 142.1 MB in the beginning and 205.5 MB in the end (delta: 63.4 MB). Free memory was 100.7 MB in the beginning and 158.1 MB in the end (delta: -57.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.64 ms. Allocated memory is still 205.5 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.54 ms. Allocated memory is still 205.5 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2138.70 ms. Allocated memory was 205.5 MB in the beginning and 245.4 MB in the end (delta: 39.8 MB). Free memory was 152.3 MB in the beginning and 156.0 MB in the end (delta: -3.7 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13191.52 ms. Allocated memory was 245.4 MB in the beginning and 398.5 MB in the end (delta: 153.1 MB). Free memory was 156.0 MB in the beginning and 267.3 MB in the end (delta: -111.3 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 911 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 56 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.3s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 25 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 4422 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2192; [L814] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2193; [L816] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2194; [L818] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe017_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 318 SDtfs, 419 SDslu, 598 SDs, 0 SdLazy, 444 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 139 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 22161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...