/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/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:04:15,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:04:15,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:04:15,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:04:15,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:04:15,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:04:15,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:04:15,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:04:15,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:04:15,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:04:15,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:04:15,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:04:15,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:04:15,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:04:15,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:04:15,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:04:15,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:04:15,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:04:15,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:04:15,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:04:15,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:04:15,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:04:15,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:04:15,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:04:15,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:04:15,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:04:15,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:04:15,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:04:15,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:04:15,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:04:15,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:04:15,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:04:15,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:04:15,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:04:15,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:04:15,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:04:15,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:04:15,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:04:15,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:04:15,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:04:15,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:04:15,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:04:15,949 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:04:15,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:04:15,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:04:15,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:04:15,952 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:04:15,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:04:15,952 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:04:15,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:04:15,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:04:15,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:04:15,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:04:15,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:04:15,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:04:15,954 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:04:15,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:04:15,955 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:04:15,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:04:15,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:04:15,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:04:15,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:04:15,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:04:15,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:15,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:04:15,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:04:15,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:04:15,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:04:15,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:04:15,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:04:15,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:04:16,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:04:16,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:04:16,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:04:16,316 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:04:16,316 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:04:16,316 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-16 12:04:16,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7b65a1245/fbfc150e8fba4fd08b4f4c8d4d941e44/FLAG7c93ed236 [2020-10-16 12:04:16,994 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:04:16,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2020-10-16 12:04:17,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7b65a1245/fbfc150e8fba4fd08b4f4c8d4d941e44/FLAG7c93ed236 [2020-10-16 12:04:17,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7b65a1245/fbfc150e8fba4fd08b4f4c8d4d941e44 [2020-10-16 12:04:17,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:04:17,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:04:17,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:17,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:04:17,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:04:17,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:17" (1/1) ... [2020-10-16 12:04:17,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7eef4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:17, skipping insertion in model container [2020-10-16 12:04:17,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:17" (1/1) ... [2020-10-16 12:04:17,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:04:17,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:04:17,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:17,841 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:04:17,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:04:18,055 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:04:18,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18 WrapperNode [2020-10-16 12:04:18,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:04:18,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:18,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:04:18,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:04:18,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:04:18,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:04:18,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:04:18,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:04:18,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... [2020-10-16 12:04:18,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:04:18,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:04:18,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:04:18,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:04:18,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:04:18,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:04:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:04:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:04:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:04:18,241 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:04:18,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:04:18,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:04:18,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:04:18,242 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:04:18,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:04:18,243 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:04:18,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:04:18,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:04:18,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:04:18,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:04:18,245 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:04:20,409 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:04:20,410 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:04:20,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:20 BoogieIcfgContainer [2020-10-16 12:04:20,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:04:20,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:04:20,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:04:20,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:04:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:17" (1/3) ... [2020-10-16 12:04:20,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0b528c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:20, skipping insertion in model container [2020-10-16 12:04:20,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:18" (2/3) ... [2020-10-16 12:04:20,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0b528c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:20, skipping insertion in model container [2020-10-16 12:04:20,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:20" (3/3) ... [2020-10-16 12:04:20,421 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2020-10-16 12:04:20,434 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:04:20,434 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:04:20,443 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:04:20,444 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:04:20,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,488 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,488 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,507 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,507 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,510 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,512 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:04:20,513 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:04:20,527 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:04:20,549 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:04:20,550 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:04:20,550 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:04:20,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:04:20,550 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:04:20,550 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:04:20,551 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:04:20,551 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:04:20,566 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:04:20,566 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 12:04:20,569 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 12:04:20,572 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 12:04:20,625 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 12:04:20,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:04:20,633 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:04:20,637 INFO L117 LiptonReduction]: Number of co-enabled transitions 2606 [2020-10-16 12:04:22,036 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-16 12:04:22,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 12:04:22,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:22,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:04:22,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:04:23,292 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-16 12:04:23,547 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 12:04:24,144 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:04:24,763 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 12:04:25,642 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108 [2020-10-16 12:04:25,929 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 12:04:27,342 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-16 12:04:27,768 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:04:28,415 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 12:04:28,975 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 12:04:29,253 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 12:04:29,401 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 12:04:29,409 INFO L132 LiptonReduction]: Checked pairs total: 7235 [2020-10-16 12:04:29,409 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-16 12:04:29,420 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-16 12:04:29,682 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-10-16 12:04:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-10-16 12:04:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:04:29,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:29,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:04:29,698 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1144240598, now seen corresponding path program 1 times [2020-10-16 12:04:29,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:29,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804176202] [2020-10-16 12:04:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:30,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804176202] [2020-10-16 12:04:30,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:30,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:30,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301462749] [2020-10-16 12:04:30,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:30,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:30,051 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-10-16 12:04:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:30,267 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions. [2020-10-16 12:04:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:30,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:04:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:30,316 INFO L225 Difference]: With dead ends: 3437 [2020-10-16 12:04:30,316 INFO L226 Difference]: Without dead ends: 2812 [2020-10-16 12:04:30,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2020-10-16 12:04:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2020-10-16 12:04:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2020-10-16 12:04:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions. [2020-10-16 12:04:30,538 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 5 [2020-10-16 12:04:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:30,538 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions. [2020-10-16 12:04:30,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions. [2020-10-16 12:04:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:04:30,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:30,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:30,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:04:30,543 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2035519121, now seen corresponding path program 1 times [2020-10-16 12:04:30,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:30,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972007162] [2020-10-16 12:04:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:30,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972007162] [2020-10-16 12:04:30,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:30,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:04:30,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643364420] [2020-10-16 12:04:30,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:04:30,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:04:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:30,705 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand 3 states. [2020-10-16 12:04:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:30,783 INFO L93 Difference]: Finished difference Result 2762 states and 10645 transitions. [2020-10-16 12:04:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:04:30,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:04:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:30,807 INFO L225 Difference]: With dead ends: 2762 [2020-10-16 12:04:30,807 INFO L226 Difference]: Without dead ends: 2762 [2020-10-16 12:04:30,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:04:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2020-10-16 12:04:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2020-10-16 12:04:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-16 12:04:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10645 transitions. [2020-10-16 12:04:30,930 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10645 transitions. Word has length 11 [2020-10-16 12:04:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:30,931 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10645 transitions. [2020-10-16 12:04:30,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:04:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10645 transitions. [2020-10-16 12:04:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:04:30,935 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:30,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:30,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:04:30,935 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1323417073, now seen corresponding path program 1 times [2020-10-16 12:04:30,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:30,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330149995] [2020-10-16 12:04:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:31,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330149995] [2020-10-16 12:04:31,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:31,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:31,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389531576] [2020-10-16 12:04:31,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:31,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:31,130 INFO L87 Difference]: Start difference. First operand 2762 states and 10645 transitions. Second operand 5 states. [2020-10-16 12:04:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:31,264 INFO L93 Difference]: Finished difference Result 2934 states and 11297 transitions. [2020-10-16 12:04:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:31,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:04:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:31,290 INFO L225 Difference]: With dead ends: 2934 [2020-10-16 12:04:31,290 INFO L226 Difference]: Without dead ends: 2934 [2020-10-16 12:04:31,291 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-16 12:04:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-10-16 12:04:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2934. [2020-10-16 12:04:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2020-10-16 12:04:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 11297 transitions. [2020-10-16 12:04:31,421 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 11297 transitions. Word has length 12 [2020-10-16 12:04:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:31,421 INFO L481 AbstractCegarLoop]: Abstraction has 2934 states and 11297 transitions. [2020-10-16 12:04:31,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 11297 transitions. [2020-10-16 12:04:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:04:31,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:31,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:31,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:04:31,427 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:31,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:31,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1877600105, now seen corresponding path program 1 times [2020-10-16 12:04:31,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:31,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871471386] [2020-10-16 12:04:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:31,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871471386] [2020-10-16 12:04:31,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:31,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:31,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854691230] [2020-10-16 12:04:31,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:31,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:31,593 INFO L87 Difference]: Start difference. First operand 2934 states and 11297 transitions. Second operand 5 states. [2020-10-16 12:04:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:31,700 INFO L93 Difference]: Finished difference Result 2920 states and 11221 transitions. [2020-10-16 12:04:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:31,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:04:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:31,726 INFO L225 Difference]: With dead ends: 2920 [2020-10-16 12:04:31,726 INFO L226 Difference]: Without dead ends: 2920 [2020-10-16 12:04:31,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-10-16 12:04:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2859. [2020-10-16 12:04:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2020-10-16 12:04:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 10977 transitions. [2020-10-16 12:04:31,838 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 10977 transitions. Word has length 13 [2020-10-16 12:04:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:31,838 INFO L481 AbstractCegarLoop]: Abstraction has 2859 states and 10977 transitions. [2020-10-16 12:04:31,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 10977 transitions. [2020-10-16 12:04:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:04:31,842 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:31,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:31,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:04:31,842 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1923938505, now seen corresponding path program 1 times [2020-10-16 12:04:31,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:31,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996803249] [2020-10-16 12:04:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:32,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996803249] [2020-10-16 12:04:32,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:32,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:32,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577358297] [2020-10-16 12:04:32,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:04:32,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:04:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:32,031 INFO L87 Difference]: Start difference. First operand 2859 states and 10977 transitions. Second operand 6 states. [2020-10-16 12:04:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:32,235 INFO L93 Difference]: Finished difference Result 3345 states and 12793 transitions. [2020-10-16 12:04:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:32,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:04:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:32,260 INFO L225 Difference]: With dead ends: 3345 [2020-10-16 12:04:32,261 INFO L226 Difference]: Without dead ends: 3345 [2020-10-16 12:04:32,261 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-16 12:04:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2020-10-16 12:04:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 3293. [2020-10-16 12:04:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2020-10-16 12:04:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 12585 transitions. [2020-10-16 12:04:32,504 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 12585 transitions. Word has length 14 [2020-10-16 12:04:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:32,505 INFO L481 AbstractCegarLoop]: Abstraction has 3293 states and 12585 transitions. [2020-10-16 12:04:32,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:04:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 12585 transitions. [2020-10-16 12:04:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:04:32,508 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:32,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:32,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:04:32,509 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash -493557330, now seen corresponding path program 1 times [2020-10-16 12:04:32,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:32,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970261277] [2020-10-16 12:04:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:32,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970261277] [2020-10-16 12:04:32,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:32,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:32,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683504735] [2020-10-16 12:04:32,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:32,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:32,641 INFO L87 Difference]: Start difference. First operand 3293 states and 12585 transitions. Second operand 4 states. [2020-10-16 12:04:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:32,691 INFO L93 Difference]: Finished difference Result 3316 states and 11559 transitions. [2020-10-16 12:04:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:32,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:04:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:32,714 INFO L225 Difference]: With dead ends: 3316 [2020-10-16 12:04:32,714 INFO L226 Difference]: Without dead ends: 2495 [2020-10-16 12:04:32,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2020-10-16 12:04:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2495. [2020-10-16 12:04:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-10-16 12:04:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 8595 transitions. [2020-10-16 12:04:32,792 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 8595 transitions. Word has length 14 [2020-10-16 12:04:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:32,793 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 8595 transitions. [2020-10-16 12:04:32,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 8595 transitions. [2020-10-16 12:04:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:04:32,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:32,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:32,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:04:32,797 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2116698178, now seen corresponding path program 1 times [2020-10-16 12:04:32,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:32,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874205089] [2020-10-16 12:04:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:32,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874205089] [2020-10-16 12:04:32,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:32,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:32,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357732631] [2020-10-16 12:04:32,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:32,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:32,872 INFO L87 Difference]: Start difference. First operand 2495 states and 8595 transitions. Second operand 5 states. [2020-10-16 12:04:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:32,936 INFO L93 Difference]: Finished difference Result 2074 states and 6613 transitions. [2020-10-16 12:04:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:32,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:04:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:32,945 INFO L225 Difference]: With dead ends: 2074 [2020-10-16 12:04:32,945 INFO L226 Difference]: Without dead ends: 1583 [2020-10-16 12:04:32,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:04:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2020-10-16 12:04:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1419. [2020-10-16 12:04:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2020-10-16 12:04:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4381 transitions. [2020-10-16 12:04:32,990 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4381 transitions. Word has length 15 [2020-10-16 12:04:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:32,990 INFO L481 AbstractCegarLoop]: Abstraction has 1419 states and 4381 transitions. [2020-10-16 12:04:32,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4381 transitions. [2020-10-16 12:04:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:04:32,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:32,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:32,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:04:32,997 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 936315465, now seen corresponding path program 1 times [2020-10-16 12:04:32,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:32,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211036444] [2020-10-16 12:04:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:33,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211036444] [2020-10-16 12:04:33,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:33,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:04:33,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994230521] [2020-10-16 12:04:33,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:04:33,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:04:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:33,144 INFO L87 Difference]: Start difference. First operand 1419 states and 4381 transitions. Second operand 6 states. [2020-10-16 12:04:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:33,223 INFO L93 Difference]: Finished difference Result 1234 states and 3787 transitions. [2020-10-16 12:04:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:04:33,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:04:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:33,228 INFO L225 Difference]: With dead ends: 1234 [2020-10-16 12:04:33,228 INFO L226 Difference]: Without dead ends: 1095 [2020-10-16 12:04:33,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:04:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-10-16 12:04:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1007. [2020-10-16 12:04:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2020-10-16 12:04:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3145 transitions. [2020-10-16 12:04:33,259 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3145 transitions. Word has length 19 [2020-10-16 12:04:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:33,259 INFO L481 AbstractCegarLoop]: Abstraction has 1007 states and 3145 transitions. [2020-10-16 12:04:33,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:04:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3145 transitions. [2020-10-16 12:04:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:04:33,263 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:33,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:33,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:04:33,264 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1916478885, now seen corresponding path program 1 times [2020-10-16 12:04:33,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:33,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319356534] [2020-10-16 12:04:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:33,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319356534] [2020-10-16 12:04:33,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:33,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:33,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380531776] [2020-10-16 12:04:33,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:04:33,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:04:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:33,378 INFO L87 Difference]: Start difference. First operand 1007 states and 3145 transitions. Second operand 6 states. [2020-10-16 12:04:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:33,534 INFO L93 Difference]: Finished difference Result 1601 states and 4975 transitions. [2020-10-16 12:04:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:04:33,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-16 12:04:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:33,540 INFO L225 Difference]: With dead ends: 1601 [2020-10-16 12:04:33,540 INFO L226 Difference]: Without dead ends: 1123 [2020-10-16 12:04:33,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:04:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2020-10-16 12:04:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1119. [2020-10-16 12:04:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-10-16 12:04:33,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3401 transitions. [2020-10-16 12:04:33,570 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3401 transitions. Word has length 23 [2020-10-16 12:04:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:33,570 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 3401 transitions. [2020-10-16 12:04:33,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:04:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3401 transitions. [2020-10-16 12:04:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:04:33,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:33,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:33,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:04:33,575 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash -734846370, now seen corresponding path program 1 times [2020-10-16 12:04:33,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:33,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508719490] [2020-10-16 12:04:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:33,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508719490] [2020-10-16 12:04:33,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:33,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:04:33,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271438037] [2020-10-16 12:04:33,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:04:33,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:04:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:04:33,724 INFO L87 Difference]: Start difference. First operand 1119 states and 3401 transitions. Second operand 9 states. [2020-10-16 12:04:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:33,842 INFO L93 Difference]: Finished difference Result 1487 states and 4430 transitions. [2020-10-16 12:04:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:04:33,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-16 12:04:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:33,847 INFO L225 Difference]: With dead ends: 1487 [2020-10-16 12:04:33,848 INFO L226 Difference]: Without dead ends: 1119 [2020-10-16 12:04:33,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:04:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2020-10-16 12:04:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2020-10-16 12:04:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-10-16 12:04:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3344 transitions. [2020-10-16 12:04:33,876 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3344 transitions. Word has length 23 [2020-10-16 12:04:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:33,877 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 3344 transitions. [2020-10-16 12:04:33,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:04:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3344 transitions. [2020-10-16 12:04:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:04:33,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:33,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:33,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:04:33,881 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash -802848926, now seen corresponding path program 2 times [2020-10-16 12:04:33,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:33,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190635625] [2020-10-16 12:04:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:33,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190635625] [2020-10-16 12:04:33,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:33,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:33,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897611732] [2020-10-16 12:04:33,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:33,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:33,947 INFO L87 Difference]: Start difference. First operand 1119 states and 3344 transitions. Second operand 4 states. [2020-10-16 12:04:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:34,046 INFO L93 Difference]: Finished difference Result 1321 states and 3787 transitions. [2020-10-16 12:04:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:34,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-16 12:04:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:34,050 INFO L225 Difference]: With dead ends: 1321 [2020-10-16 12:04:34,050 INFO L226 Difference]: Without dead ends: 994 [2020-10-16 12:04:34,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2020-10-16 12:04:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 991. [2020-10-16 12:04:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-10-16 12:04:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2883 transitions. [2020-10-16 12:04:34,076 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2883 transitions. Word has length 23 [2020-10-16 12:04:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:34,076 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 2883 transitions. [2020-10-16 12:04:34,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2883 transitions. [2020-10-16 12:04:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:04:34,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:34,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:34,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:04:34,080 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -910381089, now seen corresponding path program 2 times [2020-10-16 12:04:34,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:34,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097744419] [2020-10-16 12:04:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:34,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097744419] [2020-10-16 12:04:34,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:34,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:34,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014630352] [2020-10-16 12:04:34,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:04:34,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:04:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:04:34,174 INFO L87 Difference]: Start difference. First operand 991 states and 2883 transitions. Second operand 4 states. [2020-10-16 12:04:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:34,198 INFO L93 Difference]: Finished difference Result 1442 states and 4180 transitions. [2020-10-16 12:04:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:04:34,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-16 12:04:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:34,203 INFO L225 Difference]: With dead ends: 1442 [2020-10-16 12:04:34,203 INFO L226 Difference]: Without dead ends: 930 [2020-10-16 12:04:34,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-10-16 12:04:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 849. [2020-10-16 12:04:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-16 12:04:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2401 transitions. [2020-10-16 12:04:34,227 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2401 transitions. Word has length 23 [2020-10-16 12:04:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:34,227 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2401 transitions. [2020-10-16 12:04:34,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:04:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2401 transitions. [2020-10-16 12:04:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:04:34,232 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:34,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:34,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:04:34,232 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash 679553661, now seen corresponding path program 3 times [2020-10-16 12:04:34,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:34,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454349834] [2020-10-16 12:04:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:34,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454349834] [2020-10-16 12:04:34,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:34,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:04:34,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387432838] [2020-10-16 12:04:34,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:04:34,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:04:34,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:04:34,381 INFO L87 Difference]: Start difference. First operand 849 states and 2401 transitions. Second operand 7 states. [2020-10-16 12:04:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:34,472 INFO L93 Difference]: Finished difference Result 820 states and 2343 transitions. [2020-10-16 12:04:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:04:34,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-16 12:04:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:34,475 INFO L225 Difference]: With dead ends: 820 [2020-10-16 12:04:34,475 INFO L226 Difference]: Without dead ends: 340 [2020-10-16 12:04:34,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:04:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-10-16 12:04:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2020-10-16 12:04:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-10-16 12:04:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 923 transitions. [2020-10-16 12:04:34,484 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 923 transitions. Word has length 23 [2020-10-16 12:04:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:34,484 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 923 transitions. [2020-10-16 12:04:34,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:04:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 923 transitions. [2020-10-16 12:04:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:04:34,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:34,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:34,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:04:34,488 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1696835528, now seen corresponding path program 1 times [2020-10-16 12:04:34,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:34,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253436194] [2020-10-16 12:04:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:34,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253436194] [2020-10-16 12:04:34,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:34,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:04:34,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019122360] [2020-10-16 12:04:34,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:04:34,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:04:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:04:34,594 INFO L87 Difference]: Start difference. First operand 340 states and 923 transitions. Second operand 5 states. [2020-10-16 12:04:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:34,628 INFO L93 Difference]: Finished difference Result 486 states and 1324 transitions. [2020-10-16 12:04:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:34,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-16 12:04:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:34,631 INFO L225 Difference]: With dead ends: 486 [2020-10-16 12:04:34,631 INFO L226 Difference]: Without dead ends: 212 [2020-10-16 12:04:34,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-10-16 12:04:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2020-10-16 12:04:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-10-16 12:04:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 539 transitions. [2020-10-16 12:04:34,638 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 539 transitions. Word has length 27 [2020-10-16 12:04:34,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:34,639 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 539 transitions. [2020-10-16 12:04:34,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:04:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 539 transitions. [2020-10-16 12:04:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:04:34,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:34,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:34,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:04:34,642 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1471484460, now seen corresponding path program 2 times [2020-10-16 12:04:34,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:34,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732006586] [2020-10-16 12:04:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732006586] [2020-10-16 12:04:34,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:34,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:04:34,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854206278] [2020-10-16 12:04:34,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:04:34,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:04:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:04:34,886 INFO L87 Difference]: Start difference. First operand 212 states and 539 transitions. Second operand 6 states. [2020-10-16 12:04:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:35,020 INFO L93 Difference]: Finished difference Result 292 states and 746 transitions. [2020-10-16 12:04:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:04:35,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-16 12:04:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:35,022 INFO L225 Difference]: With dead ends: 292 [2020-10-16 12:04:35,023 INFO L226 Difference]: Without dead ends: 250 [2020-10-16 12:04:35,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:04:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-16 12:04:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 196. [2020-10-16 12:04:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-16 12:04:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 475 transitions. [2020-10-16 12:04:35,032 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 475 transitions. Word has length 27 [2020-10-16 12:04:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:35,032 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 475 transitions. [2020-10-16 12:04:35,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:04:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 475 transitions. [2020-10-16 12:04:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:04:35,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:35,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:35,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:04:35,034 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 46268212, now seen corresponding path program 3 times [2020-10-16 12:04:35,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:35,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316519565] [2020-10-16 12:04:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:35,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316519565] [2020-10-16 12:04:35,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:35,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:04:35,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719194397] [2020-10-16 12:04:35,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:04:35,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:35,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:04:35,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:04:35,404 INFO L87 Difference]: Start difference. First operand 196 states and 475 transitions. Second operand 8 states. [2020-10-16 12:04:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:35,535 INFO L93 Difference]: Finished difference Result 270 states and 663 transitions. [2020-10-16 12:04:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:35,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-16 12:04:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:35,537 INFO L225 Difference]: With dead ends: 270 [2020-10-16 12:04:35,537 INFO L226 Difference]: Without dead ends: 224 [2020-10-16 12:04:35,537 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-16 12:04:35,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-16 12:04:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 188. [2020-10-16 12:04:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-16 12:04:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 451 transitions. [2020-10-16 12:04:35,548 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 451 transitions. Word has length 27 [2020-10-16 12:04:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:35,548 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 451 transitions. [2020-10-16 12:04:35,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:04:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 451 transitions. [2020-10-16 12:04:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:04:35,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:35,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:35,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:04:35,550 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1467036698, now seen corresponding path program 4 times [2020-10-16 12:04:35,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:35,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092232375] [2020-10-16 12:04:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:35,964 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2020-10-16 12:04:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:04:36,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092232375] [2020-10-16 12:04:36,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:36,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:04:36,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28626475] [2020-10-16 12:04:36,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:04:36,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:04:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:04:36,052 INFO L87 Difference]: Start difference. First operand 188 states and 451 transitions. Second operand 8 states. [2020-10-16 12:04:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:36,178 INFO L93 Difference]: Finished difference Result 262 states and 639 transitions. [2020-10-16 12:04:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:04:36,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-16 12:04:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:36,180 INFO L225 Difference]: With dead ends: 262 [2020-10-16 12:04:36,180 INFO L226 Difference]: Without dead ends: 200 [2020-10-16 12:04:36,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:04:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-16 12:04:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2020-10-16 12:04:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-16 12:04:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 379 transitions. [2020-10-16 12:04:36,185 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 379 transitions. Word has length 27 [2020-10-16 12:04:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:36,186 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 379 transitions. [2020-10-16 12:04:36,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:04:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 379 transitions. [2020-10-16 12:04:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:04:36,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:36,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:36,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:04:36,187 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1798366810, now seen corresponding path program 5 times [2020-10-16 12:04:36,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:36,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990511548] [2020-10-16 12:04:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:04:36,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-16 12:04:36,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990511548] [2020-10-16 12:04:36,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:04:36,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:04:36,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400022297] [2020-10-16 12:04:36,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:04:36,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:04:36,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:04:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:04:36,803 INFO L87 Difference]: Start difference. First operand 164 states and 379 transitions. Second operand 9 states. [2020-10-16 12:04:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:04:37,003 INFO L93 Difference]: Finished difference Result 271 states and 635 transitions. [2020-10-16 12:04:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:04:37,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-16 12:04:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:04:37,005 INFO L225 Difference]: With dead ends: 271 [2020-10-16 12:04:37,005 INFO L226 Difference]: Without dead ends: 187 [2020-10-16 12:04:37,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:04:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-16 12:04:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 136. [2020-10-16 12:04:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-16 12:04:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 315 transitions. [2020-10-16 12:04:37,010 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 315 transitions. Word has length 27 [2020-10-16 12:04:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:04:37,010 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 315 transitions. [2020-10-16 12:04:37,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:04:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 315 transitions. [2020-10-16 12:04:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:04:37,011 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:04:37,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:04:37,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:04:37,011 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:04:37,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:04:37,012 INFO L82 PathProgramCache]: Analyzing trace with hash 83061694, now seen corresponding path program 6 times [2020-10-16 12:04:37,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:04:37,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62077760] [2020-10-16 12:04:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:04:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:04:37,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:04:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:04:37,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:04:37,140 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:04:37,140 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:04:37,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:04:37,142 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:04:37,167 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L847-->L855: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In-154710049 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-154710049 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-154710049 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-154710049 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-154710049 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-154710049|) (or (and (= ~x$w_buff1_used~0_In-154710049 ~x$w_buff1_used~0_Out-154710049) .cse0) (and .cse1 .cse2 (= ~x$w_buff1_used~0_Out-154710049 0))) (= ~x$r_buff0_thd0~0_Out-154710049 ~x$r_buff0_thd0~0_In-154710049) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-154710049 0)) (or (and .cse3 (or (and .cse1 (= ~x~0_Out-154710049 ~x$w_buff1~0_In-154710049) .cse2) (and (= ~x~0_In-154710049 ~x~0_Out-154710049) .cse0))) (and (= ~x~0_Out-154710049 ~x$w_buff0~0_In-154710049) .cse4 .cse5)) (or (and (= ~x$w_buff0_used~0_In-154710049 ~x$w_buff0_used~0_Out-154710049) .cse3) (and (= ~x$w_buff0_used~0_Out-154710049 0) .cse4 .cse5)) (= (mod ~main$tmp_guard0~0_In-154710049 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-154710049|) (= ~x$r_buff1_thd0~0_Out-154710049 ~x$r_buff1_thd0~0_In-154710049)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-154710049, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-154710049, ~x$w_buff1~0=~x$w_buff1~0_In-154710049, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-154710049, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-154710049, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-154710049, ~x~0=~x~0_In-154710049, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-154710049} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-154710049, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-154710049, ~x$w_buff1~0=~x$w_buff1~0_In-154710049, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-154710049|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-154710049, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-154710049, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-154710049, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-154710049|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-154710049|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-154710049|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-154710049, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-154710049|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-154710049|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-154710049|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-154710049, ~x~0=~x~0_Out-154710049} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-16 12:04:37,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-16 12:04:37,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,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-16 12:04:37,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:04:37,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:04:37,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:04:37 BasicIcfg [2020-10-16 12:04:37,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:04:37,267 INFO L168 Benchmark]: Toolchain (without parser) took 20014.97 ms. Allocated memory was 140.5 MB in the beginning and 501.7 MB in the end (delta: 361.2 MB). Free memory was 100.5 MB in the beginning and 208.2 MB in the end (delta: -107.7 MB). Peak memory consumption was 253.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,267 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.45 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.1 MB in the beginning and 155.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.93 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,269 INFO L168 Benchmark]: Boogie Preprocessor took 42.31 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 149.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,269 INFO L168 Benchmark]: RCFGBuilder took 2235.67 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 149.4 MB in the beginning and 135.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,270 INFO L168 Benchmark]: TraceAbstraction took 16851.74 ms. Allocated memory was 248.0 MB in the beginning and 501.7 MB in the end (delta: 253.8 MB). Free memory was 135.9 MB in the beginning and 208.2 MB in the end (delta: -72.4 MB). Peak memory consumption was 181.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:04:37,273 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.45 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.1 MB in the beginning and 155.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.93 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.31 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 149.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2235.67 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 149.4 MB in the beginning and 135.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16851.74 ms. Allocated memory was 248.0 MB in the beginning and 501.7 MB in the end (delta: 253.8 MB). Free memory was 135.9 MB in the beginning and 208.2 MB in the end (delta: -72.4 MB). Peak memory consumption was 181.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1288 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 156 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2606 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 7235 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L712] 0 _Bool x$flush_delayed; [L713] 0 int x$mem_tmp; [L714] 0 _Bool x$r_buff0_thd0; [L715] 0 _Bool x$r_buff0_thd1; [L716] 0 _Bool x$r_buff0_thd2; [L717] 0 _Bool x$r_buff0_thd3; [L718] 0 _Bool x$r_buff0_thd4; [L719] 0 _Bool x$r_buff1_thd0; [L720] 0 _Bool x$r_buff1_thd1; [L721] 0 _Bool x$r_buff1_thd2; [L722] 0 _Bool x$r_buff1_thd3; [L723] 0 _Bool x$r_buff1_thd4; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1377; [L838] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t1378; [L840] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] 0 pthread_t t1379; [L842] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1380; [L844] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L759] 2 x$w_buff1 = x$w_buff0 [L760] 2 x$w_buff0 = 2 [L761] 2 x$w_buff1_used = x$w_buff0_used [L762] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L764] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L765] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L766] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L767] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L768] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L769] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L809] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L815] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L816] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L816] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L817] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L817] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L818] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L818] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L819] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L819] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L795] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L795] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L799] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L742] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L822] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 4 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L858] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L859] 0 x$flush_delayed = weak$$choice2 [L860] 0 x$mem_tmp = x [L861] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L861] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L866] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L869] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L869] 0 x = x$flush_delayed ? x$mem_tmp : x [L870] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 578 SDtfs, 1018 SDslu, 1150 SDs, 0 SdLazy, 524 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred 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: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 630 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 75899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...