/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:32:18,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:32:18,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:32:18,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:32:18,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:32:18,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:32:18,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:32:18,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:32:18,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:32:18,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:32:18,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:32:18,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:32:18,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:32:18,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:32:18,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:32:18,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:32:18,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:32:18,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:32:18,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:32:18,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:32:18,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:32:18,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:32:18,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:32:18,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:32:18,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:32:18,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:32:18,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:32:18,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:32:18,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:32:18,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:32:18,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:32:18,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:32:18,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:32:18,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:32:18,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:32:18,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:32:18,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:32:18,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:32:18,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:32:18,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:32:18,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:32:18,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:32:19,016 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:32:19,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:32:19,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:32:19,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:32:19,018 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:32:19,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:32:19,019 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:32:19,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:32:19,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:32:19,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:32:19,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:32:19,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:32:19,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:32:19,020 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:32:19,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:32:19,020 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:32:19,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:32:19,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:32:19,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:32:19,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:32:19,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:32:19,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:32:19,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:32:19,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:32:19,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:32:19,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:32:19,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:32:19,023 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:32:19,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:32:19,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:32:19,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:32:19,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:32:19,379 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:32:19,380 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:32:19,381 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-05 23:32:19,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e565e75/760afd4c587e44728f166d6fa584d132/FLAG8ed44550b [2020-10-05 23:32:20,021 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:32:20,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-05 23:32:20,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e565e75/760afd4c587e44728f166d6fa584d132/FLAG8ed44550b [2020-10-05 23:32:20,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e565e75/760afd4c587e44728f166d6fa584d132 [2020-10-05 23:32:20,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:32:20,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:32:20,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:32:20,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:32:20,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:32:20,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:32:20" (1/1) ... [2020-10-05 23:32:20,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce2977b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:20, skipping insertion in model container [2020-10-05 23:32:20,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:32:20" (1/1) ... [2020-10-05 23:32:20,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:32:20,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:32:21,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:32:21,105 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:32:21,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:32:21,275 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:32:21,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21 WrapperNode [2020-10-05 23:32:21,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:32:21,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:32:21,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:32:21,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:32:21,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:32:21,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:32:21,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:32:21,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:32:21,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... [2020-10-05 23:32:21,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:32:21,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:32:21,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:32:21,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:32:21,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:32:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:32:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:32:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:32:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:32:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:32:21,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:32:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:32:21,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:32:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:32:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:32:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:32:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:32:21,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:32:21,480 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:32:23,700 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:32:23,700 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:32:23,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:32:23 BoogieIcfgContainer [2020-10-05 23:32:23,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:32:23,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:32:23,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:32:23,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:32:23,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:32:20" (1/3) ... [2020-10-05 23:32:23,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3504f5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:32:23, skipping insertion in model container [2020-10-05 23:32:23,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:32:21" (2/3) ... [2020-10-05 23:32:23,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3504f5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:32:23, skipping insertion in model container [2020-10-05 23:32:23,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:32:23" (3/3) ... [2020-10-05 23:32:23,711 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2020-10-05 23:32:23,721 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:32:23,722 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:32:23,731 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:32:23,732 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:32:23,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,763 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,763 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,764 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,766 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,786 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,790 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:32:23,806 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:32:23,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:32:23,829 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:32:23,829 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:32:23,829 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:32:23,829 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:32:23,829 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:32:23,830 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:32:23,830 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:32:23,847 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow [2020-10-05 23:32:23,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2020-10-05 23:32:23,899 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2020-10-05 23:32:23,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:32:23,904 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-05 23:32:23,908 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2020-10-05 23:32:23,933 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2020-10-05 23:32:23,934 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:32:23,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-05 23:32:23,937 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1990 [2020-10-05 23:32:23,938 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:32:24,546 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:32:25,997 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-05 23:32:26,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-05 23:32:26,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:32:26,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 23:32:26,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:32:26,826 WARN L193 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-05 23:32:27,176 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:32:27,297 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:32:28,360 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-05 23:32:28,724 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-05 23:32:29,396 WARN L193 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-05 23:32:29,723 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-05 23:32:30,236 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:32:30,610 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-05 23:32:31,345 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-05 23:32:31,675 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-05 23:32:32,081 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-05 23:32:32,215 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-05 23:32:32,223 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5631 [2020-10-05 23:32:32,223 INFO L214 etLargeBlockEncoding]: Total number of compositions: 83 [2020-10-05 23:32:32,226 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 28 transitions, 71 flow [2020-10-05 23:32:32,352 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states. [2020-10-05 23:32:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states. [2020-10-05 23:32:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:32:32,382 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:32,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:32:32,384 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1029880774, now seen corresponding path program 1 times [2020-10-05 23:32:32,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:32,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18559527] [2020-10-05 23:32:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:32,651 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-05 23:32:32,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18559527] [2020-10-05 23:32:32,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:32,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:32,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631313431] [2020-10-05 23:32:32,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:32,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:32,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:32,696 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand 3 states. [2020-10-05 23:32:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:32,858 INFO L93 Difference]: Finished difference Result 972 states and 3118 transitions. [2020-10-05 23:32:32,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:32,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:32:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:32,886 INFO L225 Difference]: With dead ends: 972 [2020-10-05 23:32:32,887 INFO L226 Difference]: Without dead ends: 792 [2020-10-05 23:32:32,888 INFO L675 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-05 23:32:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-10-05 23:32:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-10-05 23:32:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-10-05 23:32:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2020-10-05 23:32:32,999 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5 [2020-10-05 23:32:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:33,000 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2020-10-05 23:32:33,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2020-10-05 23:32:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:32:33,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:33,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:33,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:32:33,003 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:33,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash 380005547, now seen corresponding path program 1 times [2020-10-05 23:32:33,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:33,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722482988] [2020-10-05 23:32:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:33,161 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-05 23:32:33,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722482988] [2020-10-05 23:32:33,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:33,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:33,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716499419] [2020-10-05 23:32:33,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:33,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:33,164 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states. [2020-10-05 23:32:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:33,181 INFO L93 Difference]: Finished difference Result 732 states and 2276 transitions. [2020-10-05 23:32:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:33,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:32:33,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:33,189 INFO L225 Difference]: With dead ends: 732 [2020-10-05 23:32:33,189 INFO L226 Difference]: Without dead ends: 732 [2020-10-05 23:32:33,190 INFO L675 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-05 23:32:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-05 23:32:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-10-05 23:32:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-10-05 23:32:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions. [2020-10-05 23:32:33,222 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9 [2020-10-05 23:32:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:33,224 INFO L479 AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions. [2020-10-05 23:32:33,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions. [2020-10-05 23:32:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:32:33,226 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:33,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:33,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:32:33,227 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:33,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash 92237913, now seen corresponding path program 1 times [2020-10-05 23:32:33,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:33,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679249991] [2020-10-05 23:32:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:33,307 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-05 23:32:33,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679249991] [2020-10-05 23:32:33,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:33,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:33,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449415825] [2020-10-05 23:32:33,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:33,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:33,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:33,310 INFO L87 Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states. [2020-10-05 23:32:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:33,352 INFO L93 Difference]: Finished difference Result 724 states and 2246 transitions. [2020-10-05 23:32:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:33,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:32:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:33,359 INFO L225 Difference]: With dead ends: 724 [2020-10-05 23:32:33,360 INFO L226 Difference]: Without dead ends: 724 [2020-10-05 23:32:33,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2020-10-05 23:32:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2020-10-05 23:32:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2020-10-05 23:32:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2246 transitions. [2020-10-05 23:32:33,389 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 2246 transitions. Word has length 11 [2020-10-05 23:32:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:33,390 INFO L479 AbstractCegarLoop]: Abstraction has 724 states and 2246 transitions. [2020-10-05 23:32:33,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 2246 transitions. [2020-10-05 23:32:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:32:33,393 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:33,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:33,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:32:33,394 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1435592969, now seen corresponding path program 1 times [2020-10-05 23:32:33,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:33,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343101140] [2020-10-05 23:32:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:33,447 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-05 23:32:33,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343101140] [2020-10-05 23:32:33,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:33,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:32:33,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205951581] [2020-10-05 23:32:33,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:32:33,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:32:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:32:33,449 INFO L87 Difference]: Start difference. First operand 724 states and 2246 transitions. Second operand 3 states. [2020-10-05 23:32:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:33,464 INFO L93 Difference]: Finished difference Result 692 states and 2134 transitions. [2020-10-05 23:32:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:32:33,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:32:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:33,471 INFO L225 Difference]: With dead ends: 692 [2020-10-05 23:32:33,471 INFO L226 Difference]: Without dead ends: 692 [2020-10-05 23:32:33,472 INFO L675 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-05 23:32:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-10-05 23:32:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2020-10-05 23:32:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-10-05 23:32:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions. [2020-10-05 23:32:33,496 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 12 [2020-10-05 23:32:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:33,496 INFO L479 AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions. [2020-10-05 23:32:33,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:32:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions. [2020-10-05 23:32:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:32:33,499 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:33,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:33,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:32:33,500 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1553710148, now seen corresponding path program 1 times [2020-10-05 23:32:33,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:33,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756653375] [2020-10-05 23:32:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:33,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756653375] [2020-10-05 23:32:33,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:33,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:33,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135355092] [2020-10-05 23:32:33,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:32:33,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:32:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:33,705 INFO L87 Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 5 states. [2020-10-05 23:32:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:33,785 INFO L93 Difference]: Finished difference Result 684 states and 2102 transitions. [2020-10-05 23:32:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:32:33,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:32:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:33,792 INFO L225 Difference]: With dead ends: 684 [2020-10-05 23:32:33,792 INFO L226 Difference]: Without dead ends: 684 [2020-10-05 23:32:33,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-10-05 23:32:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2020-10-05 23:32:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-10-05 23:32:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 2102 transitions. [2020-10-05 23:32:33,813 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 2102 transitions. Word has length 13 [2020-10-05 23:32:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:33,814 INFO L479 AbstractCegarLoop]: Abstraction has 684 states and 2102 transitions. [2020-10-05 23:32:33,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:32:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 2102 transitions. [2020-10-05 23:32:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:32:33,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:33,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:33,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:32:33,816 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:33,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1513096444, now seen corresponding path program 1 times [2020-10-05 23:32:33,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:33,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204435699] [2020-10-05 23:32:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:34,011 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-05 23:32:34,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204435699] [2020-10-05 23:32:34,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:34,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:34,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775414530] [2020-10-05 23:32:34,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:34,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:34,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:34,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:34,014 INFO L87 Difference]: Start difference. First operand 684 states and 2102 transitions. Second operand 6 states. [2020-10-05 23:32:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:34,183 INFO L93 Difference]: Finished difference Result 854 states and 2611 transitions. [2020-10-05 23:32:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:34,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 23:32:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:34,191 INFO L225 Difference]: With dead ends: 854 [2020-10-05 23:32:34,192 INFO L226 Difference]: Without dead ends: 854 [2020-10-05 23:32:34,192 INFO L675 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-05 23:32:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2020-10-05 23:32:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2020-10-05 23:32:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2020-10-05 23:32:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2611 transitions. [2020-10-05 23:32:34,220 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 2611 transitions. Word has length 15 [2020-10-05 23:32:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:34,221 INFO L479 AbstractCegarLoop]: Abstraction has 854 states and 2611 transitions. [2020-10-05 23:32:34,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:34,221 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 2611 transitions. [2020-10-05 23:32:34,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:32:34,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:34,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:34,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:32:34,224 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1517521685, now seen corresponding path program 1 times [2020-10-05 23:32:34,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:34,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154766600] [2020-10-05 23:32:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:34,534 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-05 23:32:34,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154766600] [2020-10-05 23:32:34,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:34,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:34,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712720108] [2020-10-05 23:32:34,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:34,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:34,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:34,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:34,540 INFO L87 Difference]: Start difference. First operand 854 states and 2611 transitions. Second operand 6 states. [2020-10-05 23:32:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:34,771 INFO L93 Difference]: Finished difference Result 878 states and 2665 transitions. [2020-10-05 23:32:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:34,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-05 23:32:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:34,782 INFO L225 Difference]: With dead ends: 878 [2020-10-05 23:32:34,782 INFO L226 Difference]: Without dead ends: 878 [2020-10-05 23:32:34,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:32:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2020-10-05 23:32:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 788. [2020-10-05 23:32:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-10-05 23:32:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2398 transitions. [2020-10-05 23:32:34,809 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2398 transitions. Word has length 15 [2020-10-05 23:32:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:34,810 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 2398 transitions. [2020-10-05 23:32:34,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2398 transitions. [2020-10-05 23:32:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:32:34,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:34,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:34,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:32:34,813 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1533109787, now seen corresponding path program 1 times [2020-10-05 23:32:34,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:34,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604521174] [2020-10-05 23:32:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:34,864 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-05 23:32:34,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604521174] [2020-10-05 23:32:34,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:34,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:34,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207939907] [2020-10-05 23:32:34,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:32:34,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:32:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:34,866 INFO L87 Difference]: Start difference. First operand 788 states and 2398 transitions. Second operand 4 states. [2020-10-05 23:32:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:34,889 INFO L93 Difference]: Finished difference Result 1067 states and 3193 transitions. [2020-10-05 23:32:34,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:32:34,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:32:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:34,897 INFO L225 Difference]: With dead ends: 1067 [2020-10-05 23:32:34,897 INFO L226 Difference]: Without dead ends: 722 [2020-10-05 23:32:34,897 INFO L675 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-05 23:32:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2020-10-05 23:32:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 698. [2020-10-05 23:32:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2020-10-05 23:32:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2023 transitions. [2020-10-05 23:32:34,922 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2023 transitions. Word has length 15 [2020-10-05 23:32:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:34,923 INFO L479 AbstractCegarLoop]: Abstraction has 698 states and 2023 transitions. [2020-10-05 23:32:34,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:32:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2023 transitions. [2020-10-05 23:32:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:32:34,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:34,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:34,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:32:34,926 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1183987585, now seen corresponding path program 2 times [2020-10-05 23:32:34,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:34,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580434216] [2020-10-05 23:32:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:34,988 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-05 23:32:34,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580434216] [2020-10-05 23:32:34,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:34,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:34,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067806399] [2020-10-05 23:32:34,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:32:34,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:34,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:32:34,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:34,990 INFO L87 Difference]: Start difference. First operand 698 states and 2023 transitions. Second operand 4 states. [2020-10-05 23:32:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:35,027 INFO L93 Difference]: Finished difference Result 660 states and 1699 transitions. [2020-10-05 23:32:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:35,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:32:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:35,031 INFO L225 Difference]: With dead ends: 660 [2020-10-05 23:32:35,032 INFO L226 Difference]: Without dead ends: 474 [2020-10-05 23:32:35,032 INFO L675 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-05 23:32:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-10-05 23:32:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2020-10-05 23:32:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2020-10-05 23:32:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1173 transitions. [2020-10-05 23:32:35,045 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1173 transitions. Word has length 15 [2020-10-05 23:32:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:35,046 INFO L479 AbstractCegarLoop]: Abstraction has 474 states and 1173 transitions. [2020-10-05 23:32:35,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:32:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1173 transitions. [2020-10-05 23:32:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:32:35,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:35,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:32:35,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:32:35,047 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:35,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1053320640, now seen corresponding path program 1 times [2020-10-05 23:32:35,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:35,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649740637] [2020-10-05 23:32:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:35,120 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-05 23:32:35,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649740637] [2020-10-05 23:32:35,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:35,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:32:35,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986223747] [2020-10-05 23:32:35,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:32:35,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:35,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:32:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:32:35,123 INFO L87 Difference]: Start difference. First operand 474 states and 1173 transitions. Second operand 5 states. [2020-10-05 23:32:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:35,175 INFO L93 Difference]: Finished difference Result 394 states and 913 transitions. [2020-10-05 23:32:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:32:35,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:32:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:35,178 INFO L225 Difference]: With dead ends: 394 [2020-10-05 23:32:35,178 INFO L226 Difference]: Without dead ends: 311 [2020-10-05 23:32:35,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-10-05 23:32:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2020-10-05 23:32:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-10-05 23:32:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 708 transitions. [2020-10-05 23:32:35,190 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 708 transitions. Word has length 16 [2020-10-05 23:32:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:35,190 INFO L479 AbstractCegarLoop]: Abstraction has 311 states and 708 transitions. [2020-10-05 23:32:35,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:32:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 708 transitions. [2020-10-05 23:32:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:32:35,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:35,192 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-05 23:32:35,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:32:35,192 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1311971931, now seen corresponding path program 1 times [2020-10-05 23:32:35,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:35,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118413867] [2020-10-05 23:32:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:35,280 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-05 23:32:35,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118413867] [2020-10-05 23:32:35,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:35,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:32:35,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104624368] [2020-10-05 23:32:35,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:32:35,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:32:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:32:35,283 INFO L87 Difference]: Start difference. First operand 311 states and 708 transitions. Second operand 6 states. [2020-10-05 23:32:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:35,340 INFO L93 Difference]: Finished difference Result 288 states and 661 transitions. [2020-10-05 23:32:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:32:35,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 23:32:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:35,343 INFO L225 Difference]: With dead ends: 288 [2020-10-05 23:32:35,343 INFO L226 Difference]: Without dead ends: 208 [2020-10-05 23:32:35,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:32:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-05 23:32:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2020-10-05 23:32:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-05 23:32:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions. [2020-10-05 23:32:35,349 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 19 [2020-10-05 23:32:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:35,350 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 415 transitions. [2020-10-05 23:32:35,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:32:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions. [2020-10-05 23:32:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:32:35,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:35,351 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-05 23:32:35,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:32:35,352 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:35,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:35,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1271353866, now seen corresponding path program 1 times [2020-10-05 23:32:35,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:35,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986207218] [2020-10-05 23:32:35,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:35,409 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-05 23:32:35,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986207218] [2020-10-05 23:32:35,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:35,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:32:35,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887888649] [2020-10-05 23:32:35,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:32:35,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:35,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:32:35,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:32:35,411 INFO L87 Difference]: Start difference. First operand 180 states and 415 transitions. Second operand 4 states. [2020-10-05 23:32:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:35,429 INFO L93 Difference]: Finished difference Result 218 states and 492 transitions. [2020-10-05 23:32:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:32:35,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-05 23:32:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:35,431 INFO L225 Difference]: With dead ends: 218 [2020-10-05 23:32:35,431 INFO L226 Difference]: Without dead ends: 76 [2020-10-05 23:32:35,431 INFO L675 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-05 23:32:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-05 23:32:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-05 23:32:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-05 23:32:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions. [2020-10-05 23:32:35,434 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 23 [2020-10-05 23:32:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:35,434 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 143 transitions. [2020-10-05 23:32:35,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:32:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions. [2020-10-05 23:32:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:32:35,435 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:35,435 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-05 23:32:35,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:32:35,436 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash -671140278, now seen corresponding path program 2 times [2020-10-05 23:32:35,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:35,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314133679] [2020-10-05 23:32:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:32:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:32:35,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314133679] [2020-10-05 23:32:35,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:32:35,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:32:35,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826995436] [2020-10-05 23:32:35,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:32:35,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:32:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:32:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:32:35,826 INFO L87 Difference]: Start difference. First operand 76 states and 143 transitions. Second operand 8 states. [2020-10-05 23:32:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:32:35,984 INFO L93 Difference]: Finished difference Result 111 states and 201 transitions. [2020-10-05 23:32:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:32:35,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-05 23:32:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:32:35,986 INFO L225 Difference]: With dead ends: 111 [2020-10-05 23:32:35,986 INFO L226 Difference]: Without dead ends: 69 [2020-10-05 23:32:35,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:32:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-05 23:32:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2020-10-05 23:32:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-05 23:32:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-10-05 23:32:35,989 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23 [2020-10-05 23:32:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:32:35,989 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2020-10-05 23:32:35,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:32:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2020-10-05 23:32:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:32:35,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:32:35,990 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-05 23:32:35,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:32:35,991 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:32:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:32:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash 786968882, now seen corresponding path program 3 times [2020-10-05 23:32:35,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:32:35,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442250933] [2020-10-05 23:32:35,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:32:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:32:36,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:32:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:32:36,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:32:36,127 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:32:36,128 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:32:36,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:32:36,129 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:32:36,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L2-->L845: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In-1793477540 256) 0)) (.cse7 (= 0 (mod ~x$r_buff0_thd0~0_In-1793477540 256))) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1793477540 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1793477540 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~x$r_buff0_thd0~0_Out-1793477540 ~x$r_buff0_thd0~0_In-1793477540) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1793477540 0)) (or (and .cse0 (= ~x$w_buff1_used~0_Out-1793477540 0) .cse1) (and (= ~x$w_buff1_used~0_Out-1793477540 ~x$w_buff1_used~0_In-1793477540) .cse2)) (or (and (or (and (= ~x~0_Out-1793477540 ~x~0_In-1793477540) .cse2) (and .cse0 (= ~x~0_Out-1793477540 ~x$w_buff1~0_In-1793477540) .cse1)) .cse3) (and .cse4 .cse5 (= ~x$w_buff0~0_In-1793477540 ~x~0_Out-1793477540))) (or (and (= ~x$w_buff0_used~0_Out-1793477540 0) .cse4 .cse5) (and .cse3 (= ~x$w_buff0_used~0_In-1793477540 ~x$w_buff0_used~0_Out-1793477540))) (= ~x$r_buff1_thd0~0_In-1793477540 ~x$r_buff1_thd0~0_Out-1793477540) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1793477540| ULTIMATE.start_assume_abort_if_not_~cond_Out-1793477540)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1793477540, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1793477540, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1793477540|, ~x$w_buff1~0=~x$w_buff1~0_In-1793477540, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1793477540, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1793477540, ~x~0=~x~0_In-1793477540, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1793477540} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1793477540, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1793477540, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1793477540|, ~x$w_buff1~0=~x$w_buff1~0_In-1793477540, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1793477540|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1793477540, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1793477540|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1793477540|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1793477540|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1793477540, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1793477540, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1793477540|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1793477540|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1793477540, ~x~0=~x~0_Out-1793477540} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:32:36,202 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-05 23:32:36,202 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,204 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-05 23:32:36,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,204 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-05 23:32:36,204 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,204 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-05 23:32:36,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,205 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-05 23:32:36,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,205 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-05 23:32:36,205 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,205 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-05 23:32:36,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,206 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-05 23:32:36,206 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,206 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-05 23:32:36,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,207 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-05 23:32:36,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,207 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-05 23:32:36,207 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,207 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-05 23:32:36,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,208 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-05 23:32:36,208 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,208 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-05 23:32:36,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,209 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-05 23:32:36,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,209 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-05 23:32:36,209 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,209 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-05 23:32:36,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,210 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-05 23:32:36,210 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,211 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-05 23:32:36,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,211 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-05 23:32:36,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,211 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-05 23:32:36,211 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,212 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-05 23:32:36,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,212 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-05 23:32:36,212 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,212 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-05 23:32:36,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,213 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-05 23:32:36,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,213 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-05 23:32:36,213 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,213 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-05 23:32:36,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,214 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-05 23:32:36,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,214 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-05 23:32:36,214 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:32:36,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:32:36 BasicIcfg [2020-10-05 23:32:36,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:32:36,278 INFO L168 Benchmark]: Toolchain (without parser) took 15802.83 ms. Allocated memory was 146.8 MB in the beginning and 414.2 MB in the end (delta: 267.4 MB). Free memory was 100.0 MB in the beginning and 361.8 MB in the end (delta: -261.8 MB). Peak memory consumption was 240.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,279 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.42 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 99.8 MB in the beginning and 154.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.89 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 151.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,281 INFO L168 Benchmark]: Boogie Preprocessor took 41.47 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,282 INFO L168 Benchmark]: RCFGBuilder took 2316.33 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 148.9 MB in the beginning and 167.3 MB in the end (delta: -18.4 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,283 INFO L168 Benchmark]: TraceAbstraction took 12572.22 ms. Allocated memory was 248.0 MB in the beginning and 414.2 MB in the end (delta: 166.2 MB). Free memory was 167.3 MB in the beginning and 361.8 MB in the end (delta: -194.5 MB). Peak memory consumption was 206.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:32:36,287 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.59 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.42 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 99.8 MB in the beginning and 154.9 MB in the end (delta: -55.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.89 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 151.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.47 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2316.33 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 148.9 MB in the beginning and 167.3 MB in the end (delta: -18.4 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12572.22 ms. Allocated memory was 248.0 MB in the beginning and 414.2 MB in the end (delta: 166.2 MB). Free memory was 167.3 MB in the beginning and 361.8 MB in the end (delta: -194.5 MB). Peak memory consumption was 206.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.3s, 109 ProgramPointsBefore, 38 ProgramPointsAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1990 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 1041 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5631 CheckedPairsTotal, 83 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p1_EBX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L708] 0 int a = 0; [L710] 0 int b = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff0_thd3; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$r_buff1_thd3; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L829] 0 pthread_t t891; [L830] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t892; [L832] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t893; [L834] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 a = 1 [L801] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] 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) [L781] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L781] 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) [L781] 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) [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 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 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 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 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L746] 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) [L746] 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) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 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 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 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) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] 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) [L807] 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) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 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 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 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 [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L848] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L849] 0 x$flush_delayed = weak$$choice2 [L850] 0 x$mem_tmp = x [L851] 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) [L851] 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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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)) [L854] 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)) [L854] 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)) [L855] 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)) [L855] 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)) [L856] 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)) [L856] 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) [L856] 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)) [L856] 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)) [L857] 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)) [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L857] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L857] 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)) [L857] 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)) [L858] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L859] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L859] 0 x = x$flush_delayed ? x$mem_tmp : x [L860] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 348 SDtfs, 371 SDslu, 562 SDs, 0 SdLazy, 247 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 157 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 24704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...