/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/safe032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:11:39,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:11:39,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:11:39,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:11:39,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:11:39,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:11:39,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:11:39,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:11:39,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:11:39,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:11:39,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:11:39,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:11:39,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:11:39,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:11:39,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:11:39,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:11:39,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:11:39,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:11:39,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:11:39,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:11:39,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:11:39,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:11:39,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:11:39,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:11:39,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:11:39,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:11:39,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:11:39,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:11:39,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:11:39,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:11:39,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:11:39,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:11:39,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:11:39,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:11:39,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:11:39,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:11:39,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:11:39,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:11:39,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:11:39,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:11:39,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:11:39,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:11:39,573 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:11:39,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:11:39,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:11:39,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:11:39,575 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:11:39,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:11:39,575 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:11:39,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:11:39,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:11:39,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:11:39,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:11:39,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:11:39,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:11:39,577 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:11:39,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:11:39,577 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:11:39,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:11:39,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:11:39,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:11:39,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:11:39,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:11:39,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:39,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:11:39,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:11:39,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:11:39,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:11:39,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:11:39,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:11:39,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:11:39,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:11:39,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:11:39,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:11:39,915 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:11:39,916 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:11:39,917 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc.i [2020-10-16 12:11:39,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/30bf2d9db/5c6f20d63c394d5fbc3858e8419cc7ce/FLAG795e014be [2020-10-16 12:11:40,560 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:11:40,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc.i [2020-10-16 12:11:40,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/30bf2d9db/5c6f20d63c394d5fbc3858e8419cc7ce/FLAG795e014be [2020-10-16 12:11:40,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/30bf2d9db/5c6f20d63c394d5fbc3858e8419cc7ce [2020-10-16 12:11:40,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:11:40,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:11:40,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:40,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:11:40,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:11:40,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:40" (1/1) ... [2020-10-16 12:11:40,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a78847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:40, skipping insertion in model container [2020-10-16 12:11:40,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:40" (1/1) ... [2020-10-16 12:11:40,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:11:40,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:11:41,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:41,491 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:11:41,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:41,644 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:11:41,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41 WrapperNode [2020-10-16 12:11:41,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:41,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:41,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:11:41,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:11:41,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:41,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:11:41,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:11:41,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:11:41,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... [2020-10-16 12:11:41,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:11:41,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:11:41,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:11:41,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:11:41,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:11:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:11:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:11:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:11:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:11:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:11:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:11:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:11:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:11:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:11:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:11:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:11:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:11:41,880 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:11:45,356 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:11:45,356 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:11:45,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:45 BoogieIcfgContainer [2020-10-16 12:11:45,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:11:45,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:11:45,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:11:45,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:11:45,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:11:40" (1/3) ... [2020-10-16 12:11:45,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbb4a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:45, skipping insertion in model container [2020-10-16 12:11:45,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:41" (2/3) ... [2020-10-16 12:11:45,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbb4a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:45, skipping insertion in model container [2020-10-16 12:11:45,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:45" (3/3) ... [2020-10-16 12:11:45,368 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc.i [2020-10-16 12:11:45,380 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:11:45,381 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:11:45,389 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:11:45,390 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:11:45,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,473 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,473 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,509 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,513 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:45,516 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:11:45,534 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:11:45,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:11:45,561 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:11:45,561 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:11:45,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:11:45,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:11:45,562 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:11:45,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:11:45,562 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:11:45,577 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:11:45,578 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:45,581 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:45,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 12:11:45,639 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 12:11:45,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:11:45,645 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:11:45,648 INFO L117 LiptonReduction]: Number of co-enabled transitions 1624 [2020-10-16 12:11:45,993 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:11:46,789 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:11:48,219 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 12:11:48,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 12:11:48,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:48,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:11:48,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:49,522 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-10-16 12:11:50,537 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-16 12:11:50,865 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 12:11:52,541 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 12:11:52,972 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:11:53,209 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:11:53,317 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:11:53,330 INFO L132 LiptonReduction]: Checked pairs total: 4248 [2020-10-16 12:11:53,330 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 12:11:53,344 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:11:53,416 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-16 12:11:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-16 12:11:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:11:53,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:53,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:53,437 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-16 12:11:53,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:53,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717111223] [2020-10-16 12:11:53,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:53,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717111223] [2020-10-16 12:11:53,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:53,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:53,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991549941] [2020-10-16 12:11:53,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:53,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:53,861 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-16 12:11:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:54,015 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-10-16 12:11:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:54,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:11:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:54,043 INFO L225 Difference]: With dead ends: 658 [2020-10-16 12:11:54,044 INFO L226 Difference]: Without dead ends: 538 [2020-10-16 12:11:54,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-16 12:11:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-10-16 12:11:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-16 12:11:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-10-16 12:11:54,135 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-10-16 12:11:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:54,137 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-10-16 12:11:54,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-10-16 12:11:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:54,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:54,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:54,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:11:54,139 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-16 12:11:54,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:54,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681220931] [2020-10-16 12:11:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:54,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681220931] [2020-10-16 12:11:54,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:54,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:54,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164348232] [2020-10-16 12:11:54,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:54,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:54,243 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 3 states. [2020-10-16 12:11:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:54,263 INFO L93 Difference]: Finished difference Result 478 states and 1431 transitions. [2020-10-16 12:11:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:54,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:11:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:54,270 INFO L225 Difference]: With dead ends: 478 [2020-10-16 12:11:54,270 INFO L226 Difference]: Without dead ends: 478 [2020-10-16 12:11:54,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-16 12:11:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2020-10-16 12:11:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-10-16 12:11:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1431 transitions. [2020-10-16 12:11:54,303 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1431 transitions. Word has length 9 [2020-10-16 12:11:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:54,304 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 1431 transitions. [2020-10-16 12:11:54,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1431 transitions. [2020-10-16 12:11:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:54,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:54,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:54,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:11:54,308 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1678623485, now seen corresponding path program 1 times [2020-10-16 12:11:54,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:54,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051278447] [2020-10-16 12:11:54,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:54,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051278447] [2020-10-16 12:11:54,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:54,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:54,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127413333] [2020-10-16 12:11:54,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:54,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:54,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:54,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:54,413 INFO L87 Difference]: Start difference. First operand 478 states and 1431 transitions. Second operand 3 states. [2020-10-16 12:11:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:54,426 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-10-16 12:11:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:54,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:11:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:54,431 INFO L225 Difference]: With dead ends: 472 [2020-10-16 12:11:54,431 INFO L226 Difference]: Without dead ends: 472 [2020-10-16 12:11:54,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-16 12:11:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-10-16 12:11:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-16 12:11:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-10-16 12:11:54,454 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 12 [2020-10-16 12:11:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:54,454 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-10-16 12:11:54,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-10-16 12:11:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:54,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:54,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:54,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:11:54,462 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 733241045, now seen corresponding path program 1 times [2020-10-16 12:11:54,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:54,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615637464] [2020-10-16 12:11:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:54,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615637464] [2020-10-16 12:11:54,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:54,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:54,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974998959] [2020-10-16 12:11:54,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:54,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:54,800 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 6 states. [2020-10-16 12:11:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:55,017 INFO L93 Difference]: Finished difference Result 475 states and 1414 transitions. [2020-10-16 12:11:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:55,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:11:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:55,025 INFO L225 Difference]: With dead ends: 475 [2020-10-16 12:11:55,025 INFO L226 Difference]: Without dead ends: 475 [2020-10-16 12:11:55,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-10-16 12:11:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 463. [2020-10-16 12:11:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-10-16 12:11:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1379 transitions. [2020-10-16 12:11:55,044 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1379 transitions. Word has length 13 [2020-10-16 12:11:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:55,045 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 1379 transitions. [2020-10-16 12:11:55,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1379 transitions. [2020-10-16 12:11:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:55,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:55,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:55,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:11:55,055 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1255080755, now seen corresponding path program 1 times [2020-10-16 12:11:55,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:55,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338968461] [2020-10-16 12:11:55,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:55,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338968461] [2020-10-16 12:11:55,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:55,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:55,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385017717] [2020-10-16 12:11:55,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:55,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:55,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:55,352 INFO L87 Difference]: Start difference. First operand 463 states and 1379 transitions. Second operand 6 states. [2020-10-16 12:11:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:55,523 INFO L93 Difference]: Finished difference Result 597 states and 1806 transitions. [2020-10-16 12:11:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:55,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:11:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:55,530 INFO L225 Difference]: With dead ends: 597 [2020-10-16 12:11:55,530 INFO L226 Difference]: Without dead ends: 597 [2020-10-16 12:11:55,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-16 12:11:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 499. [2020-10-16 12:11:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-10-16 12:11:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1496 transitions. [2020-10-16 12:11:55,551 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1496 transitions. Word has length 14 [2020-10-16 12:11:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:55,551 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 1496 transitions. [2020-10-16 12:11:55,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1496 transitions. [2020-10-16 12:11:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:55,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:55,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:55,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:11:55,554 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:55,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1255635965, now seen corresponding path program 2 times [2020-10-16 12:11:55,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:55,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205994396] [2020-10-16 12:11:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:55,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205994396] [2020-10-16 12:11:55,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:55,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:55,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310187962] [2020-10-16 12:11:55,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:55,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:55,714 INFO L87 Difference]: Start difference. First operand 499 states and 1496 transitions. Second operand 6 states. [2020-10-16 12:11:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:55,873 INFO L93 Difference]: Finished difference Result 600 states and 1794 transitions. [2020-10-16 12:11:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:55,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:11:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:55,879 INFO L225 Difference]: With dead ends: 600 [2020-10-16 12:11:55,879 INFO L226 Difference]: Without dead ends: 600 [2020-10-16 12:11:55,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2020-10-16 12:11:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 506. [2020-10-16 12:11:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-10-16 12:11:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1504 transitions. [2020-10-16 12:11:55,899 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1504 transitions. Word has length 14 [2020-10-16 12:11:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:55,900 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 1504 transitions. [2020-10-16 12:11:55,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1504 transitions. [2020-10-16 12:11:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:55,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:55,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:55,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:11:55,902 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1248077345, now seen corresponding path program 1 times [2020-10-16 12:11:55,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:55,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877715690] [2020-10-16 12:11:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:56,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877715690] [2020-10-16 12:11:56,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:56,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:56,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934264586] [2020-10-16 12:11:56,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:56,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:56,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:56,079 INFO L87 Difference]: Start difference. First operand 506 states and 1504 transitions. Second operand 6 states. [2020-10-16 12:11:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:56,270 INFO L93 Difference]: Finished difference Result 752 states and 2183 transitions. [2020-10-16 12:11:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:56,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:11:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:56,280 INFO L225 Difference]: With dead ends: 752 [2020-10-16 12:11:56,280 INFO L226 Difference]: Without dead ends: 752 [2020-10-16 12:11:56,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-10-16 12:11:56,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 550. [2020-10-16 12:11:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-16 12:11:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1616 transitions. [2020-10-16 12:11:56,304 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1616 transitions. Word has length 15 [2020-10-16 12:11:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:56,304 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1616 transitions. [2020-10-16 12:11:56,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1616 transitions. [2020-10-16 12:11:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:56,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:56,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:56,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:11:56,306 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1248632555, now seen corresponding path program 2 times [2020-10-16 12:11:56,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:56,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820350746] [2020-10-16 12:11:56,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:56,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820350746] [2020-10-16 12:11:56,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:56,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:56,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053091517] [2020-10-16 12:11:56,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:56,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:56,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:56,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:56,486 INFO L87 Difference]: Start difference. First operand 550 states and 1616 transitions. Second operand 6 states. [2020-10-16 12:11:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:56,698 INFO L93 Difference]: Finished difference Result 760 states and 2169 transitions. [2020-10-16 12:11:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:56,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:11:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:56,704 INFO L225 Difference]: With dead ends: 760 [2020-10-16 12:11:56,705 INFO L226 Difference]: Without dead ends: 736 [2020-10-16 12:11:56,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-10-16 12:11:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 524. [2020-10-16 12:11:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-10-16 12:11:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1523 transitions. [2020-10-16 12:11:56,724 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1523 transitions. Word has length 15 [2020-10-16 12:11:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:56,724 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 1523 transitions. [2020-10-16 12:11:56,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1523 transitions. [2020-10-16 12:11:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:56,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:56,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:56,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:11:56,726 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:56,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:56,727 INFO L82 PathProgramCache]: Analyzing trace with hash -241827799, now seen corresponding path program 1 times [2020-10-16 12:11:56,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:56,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028274365] [2020-10-16 12:11:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:57,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028274365] [2020-10-16 12:11:57,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:57,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:11:57,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334968886] [2020-10-16 12:11:57,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:11:57,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:57,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:11:57,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:11:57,194 INFO L87 Difference]: Start difference. First operand 524 states and 1523 transitions. Second operand 9 states. [2020-10-16 12:11:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:57,513 INFO L93 Difference]: Finished difference Result 718 states and 2102 transitions. [2020-10-16 12:11:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:57,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-16 12:11:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:57,525 INFO L225 Difference]: With dead ends: 718 [2020-10-16 12:11:57,525 INFO L226 Difference]: Without dead ends: 718 [2020-10-16 12:11:57,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:11:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-10-16 12:11:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 528. [2020-10-16 12:11:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-16 12:11:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1551 transitions. [2020-10-16 12:11:57,543 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1551 transitions. Word has length 15 [2020-10-16 12:11:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:57,544 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 1551 transitions. [2020-10-16 12:11:57,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:11:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1551 transitions. [2020-10-16 12:11:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:57,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:57,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:57,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:11:57,546 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 251229687, now seen corresponding path program 2 times [2020-10-16 12:11:57,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:57,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715861820] [2020-10-16 12:11:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715861820] [2020-10-16 12:11:58,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:11:58,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594405785] [2020-10-16 12:11:58,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:11:58,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:11:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:11:58,082 INFO L87 Difference]: Start difference. First operand 528 states and 1551 transitions. Second operand 9 states. [2020-10-16 12:11:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:58,506 INFO L93 Difference]: Finished difference Result 660 states and 1951 transitions. [2020-10-16 12:11:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:58,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-16 12:11:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:58,513 INFO L225 Difference]: With dead ends: 660 [2020-10-16 12:11:58,513 INFO L226 Difference]: Without dead ends: 660 [2020-10-16 12:11:58,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:11:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-10-16 12:11:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 552. [2020-10-16 12:11:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-16 12:11:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1633 transitions. [2020-10-16 12:11:58,531 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1633 transitions. Word has length 15 [2020-10-16 12:11:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:58,531 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1633 transitions. [2020-10-16 12:11:58,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:11:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1633 transitions. [2020-10-16 12:11:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:58,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:58,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:58,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:11:58,534 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 98029383, now seen corresponding path program 3 times [2020-10-16 12:11:58,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:58,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495763056] [2020-10-16 12:11:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:58,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495763056] [2020-10-16 12:11:58,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:58,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:11:58,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519461363] [2020-10-16 12:11:58,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:11:58,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:58,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:11:58,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:58,971 INFO L87 Difference]: Start difference. First operand 552 states and 1633 transitions. Second operand 8 states. [2020-10-16 12:11:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:59,434 INFO L93 Difference]: Finished difference Result 690 states and 2032 transitions. [2020-10-16 12:11:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:11:59,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-16 12:11:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:59,440 INFO L225 Difference]: With dead ends: 690 [2020-10-16 12:11:59,441 INFO L226 Difference]: Without dead ends: 690 [2020-10-16 12:11:59,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:11:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2020-10-16 12:11:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 546. [2020-10-16 12:11:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-10-16 12:11:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1606 transitions. [2020-10-16 12:11:59,458 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1606 transitions. Word has length 15 [2020-10-16 12:11:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:59,458 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 1606 transitions. [2020-10-16 12:11:59,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:11:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1606 transitions. [2020-10-16 12:11:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:11:59,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:59,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:59,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:11:59,461 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2101548220, now seen corresponding path program 1 times [2020-10-16 12:11:59,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:59,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577625329] [2020-10-16 12:11:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:59,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577625329] [2020-10-16 12:11:59,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:59,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:59,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100067867] [2020-10-16 12:11:59,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:59,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:59,520 INFO L87 Difference]: Start difference. First operand 546 states and 1606 transitions. Second operand 3 states. [2020-10-16 12:11:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:59,536 INFO L93 Difference]: Finished difference Result 744 states and 2137 transitions. [2020-10-16 12:11:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:59,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-16 12:11:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:59,540 INFO L225 Difference]: With dead ends: 744 [2020-10-16 12:11:59,541 INFO L226 Difference]: Without dead ends: 412 [2020-10-16 12:11:59,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2020-10-16 12:11:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 400. [2020-10-16 12:11:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-16 12:11:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1091 transitions. [2020-10-16 12:11:59,552 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1091 transitions. Word has length 15 [2020-10-16 12:11:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:59,553 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 1091 transitions. [2020-10-16 12:11:59,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1091 transitions. [2020-10-16 12:11:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:11:59,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:59,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:59,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:11:59,555 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:59,555 INFO L82 PathProgramCache]: Analyzing trace with hash -810770517, now seen corresponding path program 1 times [2020-10-16 12:11:59,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:59,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131508014] [2020-10-16 12:11:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:59,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131508014] [2020-10-16 12:11:59,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:59,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:59,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051786451] [2020-10-16 12:11:59,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:59,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:59,708 INFO L87 Difference]: Start difference. First operand 400 states and 1091 transitions. Second operand 6 states. [2020-10-16 12:12:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:00,010 INFO L93 Difference]: Finished difference Result 614 states and 1647 transitions. [2020-10-16 12:12:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:12:00,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:12:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:00,014 INFO L225 Difference]: With dead ends: 614 [2020-10-16 12:12:00,015 INFO L226 Difference]: Without dead ends: 538 [2020-10-16 12:12:00,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-16 12:12:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 410. [2020-10-16 12:12:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 12:12:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1117 transitions. [2020-10-16 12:12:00,028 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1117 transitions. Word has length 16 [2020-10-16 12:12:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:00,028 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1117 transitions. [2020-10-16 12:12:00,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1117 transitions. [2020-10-16 12:12:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:00,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:00,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:00,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:12:00,033 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash -219687627, now seen corresponding path program 2 times [2020-10-16 12:12:00,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:00,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912339607] [2020-10-16 12:12:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:00,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912339607] [2020-10-16 12:12:00,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:00,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:12:00,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984455889] [2020-10-16 12:12:00,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:12:00,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:12:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:12:00,444 INFO L87 Difference]: Start difference. First operand 410 states and 1117 transitions. Second operand 9 states. [2020-10-16 12:12:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:01,223 INFO L93 Difference]: Finished difference Result 786 states and 2098 transitions. [2020-10-16 12:12:01,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:01,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 12:12:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:01,228 INFO L225 Difference]: With dead ends: 786 [2020-10-16 12:12:01,228 INFO L226 Difference]: Without dead ends: 728 [2020-10-16 12:12:01,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2020-10-16 12:12:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-16 12:12:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 422. [2020-10-16 12:12:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-16 12:12:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1146 transitions. [2020-10-16 12:12:01,282 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1146 transitions. Word has length 16 [2020-10-16 12:12:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:01,282 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1146 transitions. [2020-10-16 12:12:01,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:12:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1146 transitions. [2020-10-16 12:12:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:01,283 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:01,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:01,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:12:01,284 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:01,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1458952055, now seen corresponding path program 3 times [2020-10-16 12:12:01,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:01,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102026449] [2020-10-16 12:12:01,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:01,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102026449] [2020-10-16 12:12:01,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:01,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:01,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923692948] [2020-10-16 12:12:01,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:01,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:01,504 INFO L87 Difference]: Start difference. First operand 422 states and 1146 transitions. Second operand 6 states. [2020-10-16 12:12:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:01,787 INFO L93 Difference]: Finished difference Result 560 states and 1502 transitions. [2020-10-16 12:12:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:01,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:12:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:01,791 INFO L225 Difference]: With dead ends: 560 [2020-10-16 12:12:01,791 INFO L226 Difference]: Without dead ends: 482 [2020-10-16 12:12:01,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:12:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-16 12:12:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 440. [2020-10-16 12:12:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 12:12:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1197 transitions. [2020-10-16 12:12:01,803 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1197 transitions. Word has length 16 [2020-10-16 12:12:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:01,803 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1197 transitions. [2020-10-16 12:12:01,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1197 transitions. [2020-10-16 12:12:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:01,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:01,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:01,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:12:01,805 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1265012645, now seen corresponding path program 4 times [2020-10-16 12:12:01,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:01,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219320220] [2020-10-16 12:12:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:02,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219320220] [2020-10-16 12:12:02,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:02,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:12:02,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873079293] [2020-10-16 12:12:02,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:12:02,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:12:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:02,228 INFO L87 Difference]: Start difference. First operand 440 states and 1197 transitions. Second operand 8 states. [2020-10-16 12:12:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:02,646 INFO L93 Difference]: Finished difference Result 518 states and 1396 transitions. [2020-10-16 12:12:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 12:12:02,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 12:12:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:02,651 INFO L225 Difference]: With dead ends: 518 [2020-10-16 12:12:02,651 INFO L226 Difference]: Without dead ends: 489 [2020-10-16 12:12:02,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-10-16 12:12:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 435. [2020-10-16 12:12:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-10-16 12:12:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1180 transitions. [2020-10-16 12:12:02,663 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1180 transitions. Word has length 16 [2020-10-16 12:12:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:02,663 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 1180 transitions. [2020-10-16 12:12:02,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:12:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1180 transitions. [2020-10-16 12:12:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:02,665 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:02,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:02,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:12:02,665 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -302885909, now seen corresponding path program 5 times [2020-10-16 12:12:02,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:02,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416125961] [2020-10-16 12:12:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:02,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416125961] [2020-10-16 12:12:02,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:02,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:02,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503090215] [2020-10-16 12:12:02,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:02,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:02,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:02,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:02,836 INFO L87 Difference]: Start difference. First operand 435 states and 1180 transitions. Second operand 6 states. [2020-10-16 12:12:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:02,983 INFO L93 Difference]: Finished difference Result 625 states and 1674 transitions. [2020-10-16 12:12:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:02,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:12:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:02,988 INFO L225 Difference]: With dead ends: 625 [2020-10-16 12:12:02,988 INFO L226 Difference]: Without dead ends: 489 [2020-10-16 12:12:02,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-10-16 12:12:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 449. [2020-10-16 12:12:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-10-16 12:12:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1219 transitions. [2020-10-16 12:12:03,002 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1219 transitions. Word has length 16 [2020-10-16 12:12:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,002 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 1219 transitions. [2020-10-16 12:12:03,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1219 transitions. [2020-10-16 12:12:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:03,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:12:03,004 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,005 INFO L82 PathProgramCache]: Analyzing trace with hash 555393975, now seen corresponding path program 6 times [2020-10-16 12:12:03,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394149578] [2020-10-16 12:12:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:03,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394149578] [2020-10-16 12:12:03,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:03,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:03,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798700607] [2020-10-16 12:12:03,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:03,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:03,268 INFO L87 Difference]: Start difference. First operand 449 states and 1219 transitions. Second operand 7 states. [2020-10-16 12:12:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:03,456 INFO L93 Difference]: Finished difference Result 614 states and 1653 transitions. [2020-10-16 12:12:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:03,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 12:12:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:03,459 INFO L225 Difference]: With dead ends: 614 [2020-10-16 12:12:03,459 INFO L226 Difference]: Without dead ends: 485 [2020-10-16 12:12:03,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2020-10-16 12:12:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 476. [2020-10-16 12:12:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2020-10-16 12:12:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1299 transitions. [2020-10-16 12:12:03,470 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1299 transitions. Word has length 16 [2020-10-16 12:12:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:03,471 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 1299 transitions. [2020-10-16 12:12:03,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1299 transitions. [2020-10-16 12:12:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:03,472 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:03,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:03,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:12:03,473 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1953775231, now seen corresponding path program 7 times [2020-10-16 12:12:03,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:03,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462854175] [2020-10-16 12:12:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:03,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462854175] [2020-10-16 12:12:03,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:03,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:12:03,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629920431] [2020-10-16 12:12:03,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:12:03,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:12:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:03,967 INFO L87 Difference]: Start difference. First operand 476 states and 1299 transitions. Second operand 8 states. [2020-10-16 12:12:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,291 INFO L93 Difference]: Finished difference Result 743 states and 1975 transitions. [2020-10-16 12:12:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:12:04,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 12:12:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,295 INFO L225 Difference]: With dead ends: 743 [2020-10-16 12:12:04,295 INFO L226 Difference]: Without dead ends: 464 [2020-10-16 12:12:04,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-16 12:12:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 347. [2020-10-16 12:12:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-16 12:12:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 920 transitions. [2020-10-16 12:12:04,304 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 920 transitions. Word has length 16 [2020-10-16 12:12:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,304 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 920 transitions. [2020-10-16 12:12:04,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:12:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 920 transitions. [2020-10-16 12:12:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:12:04,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:12:04,306 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash -723485020, now seen corresponding path program 1 times [2020-10-16 12:12:04,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375866832] [2020-10-16 12:12:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:04,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375866832] [2020-10-16 12:12:04,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:04,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:12:04,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650572464] [2020-10-16 12:12:04,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:12:04,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:12:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:12:04,396 INFO L87 Difference]: Start difference. First operand 347 states and 920 transitions. Second operand 4 states. [2020-10-16 12:12:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,429 INFO L93 Difference]: Finished difference Result 333 states and 770 transitions. [2020-10-16 12:12:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:12:04,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:12:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,432 INFO L225 Difference]: With dead ends: 333 [2020-10-16 12:12:04,432 INFO L226 Difference]: Without dead ends: 226 [2020-10-16 12:12:04,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-10-16 12:12:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2020-10-16 12:12:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-10-16 12:12:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 494 transitions. [2020-10-16 12:12:04,438 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 494 transitions. Word has length 16 [2020-10-16 12:12:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,438 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 494 transitions. [2020-10-16 12:12:04,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:12:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 494 transitions. [2020-10-16 12:12:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:12:04,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:12:04,439 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash 233701298, now seen corresponding path program 1 times [2020-10-16 12:12:04,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780188443] [2020-10-16 12:12:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:04,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780188443] [2020-10-16 12:12:04,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:04,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:12:04,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953019350] [2020-10-16 12:12:04,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:12:04,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:12:04,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:12:04,533 INFO L87 Difference]: Start difference. First operand 226 states and 494 transitions. Second operand 5 states. [2020-10-16 12:12:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,585 INFO L93 Difference]: Finished difference Result 193 states and 386 transitions. [2020-10-16 12:12:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:12:04,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:12:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,588 INFO L225 Difference]: With dead ends: 193 [2020-10-16 12:12:04,588 INFO L226 Difference]: Without dead ends: 147 [2020-10-16 12:12:04,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-16 12:12:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2020-10-16 12:12:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-16 12:12:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 266 transitions. [2020-10-16 12:12:04,594 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 266 transitions. Word has length 17 [2020-10-16 12:12:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,594 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 266 transitions. [2020-10-16 12:12:04,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:12:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 266 transitions. [2020-10-16 12:12:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:12:04,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:12:04,596 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash -499071186, now seen corresponding path program 1 times [2020-10-16 12:12:04,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962821046] [2020-10-16 12:12:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:04,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962821046] [2020-10-16 12:12:04,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:04,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:04,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289875815] [2020-10-16 12:12:04,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:12:04,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:04,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:12:04,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:12:04,710 INFO L87 Difference]: Start difference. First operand 138 states and 266 transitions. Second operand 6 states. [2020-10-16 12:12:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:04,770 INFO L93 Difference]: Finished difference Result 126 states and 241 transitions. [2020-10-16 12:12:04,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:12:04,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 12:12:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:04,772 INFO L225 Difference]: With dead ends: 126 [2020-10-16 12:12:04,773 INFO L226 Difference]: Without dead ends: 103 [2020-10-16 12:12:04,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-16 12:12:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2020-10-16 12:12:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-16 12:12:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 178 transitions. [2020-10-16 12:12:04,776 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 178 transitions. Word has length 19 [2020-10-16 12:12:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:04,777 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 178 transitions. [2020-10-16 12:12:04,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:12:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 178 transitions. [2020-10-16 12:12:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:04,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:04,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:04,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:12:04,779 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -697931189, now seen corresponding path program 1 times [2020-10-16 12:12:04,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:04,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300427408] [2020-10-16 12:12:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:05,395 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-10-16 12:12:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:05,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300427408] [2020-10-16 12:12:05,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:05,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 12:12:05,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29788846] [2020-10-16 12:12:05,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 12:12:05,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 12:12:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:05,713 INFO L87 Difference]: Start difference. First operand 95 states and 178 transitions. Second operand 13 states. [2020-10-16 12:12:05,885 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2020-10-16 12:12:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:06,406 INFO L93 Difference]: Finished difference Result 115 states and 203 transitions. [2020-10-16 12:12:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 12:12:06,407 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-16 12:12:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:06,407 INFO L225 Difference]: With dead ends: 115 [2020-10-16 12:12:06,408 INFO L226 Difference]: Without dead ends: 101 [2020-10-16 12:12:06,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:12:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-16 12:12:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2020-10-16 12:12:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-16 12:12:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2020-10-16 12:12:06,410 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2020-10-16 12:12:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:06,411 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2020-10-16 12:12:06,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 12:12:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2020-10-16 12:12:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:06,411 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:06,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:06,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 12:12:06,412 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1113770657, now seen corresponding path program 2 times [2020-10-16 12:12:06,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:06,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207430937] [2020-10-16 12:12:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:06,895 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-10-16 12:12:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:07,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207430937] [2020-10-16 12:12:07,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:07,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 12:12:07,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580873738] [2020-10-16 12:12:07,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 12:12:07,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 12:12:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:12:07,239 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand 13 states. [2020-10-16 12:12:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:08,646 INFO L93 Difference]: Finished difference Result 124 states and 223 transitions. [2020-10-16 12:12:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 12:12:08,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-16 12:12:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:08,648 INFO L225 Difference]: With dead ends: 124 [2020-10-16 12:12:08,648 INFO L226 Difference]: Without dead ends: 86 [2020-10-16 12:12:08,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2020-10-16 12:12:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-16 12:12:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2020-10-16 12:12:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-16 12:12:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 142 transitions. [2020-10-16 12:12:08,651 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 142 transitions. Word has length 21 [2020-10-16 12:12:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:08,652 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 142 transitions. [2020-10-16 12:12:08,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 12:12:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 142 transitions. [2020-10-16 12:12:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:08,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:08,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:08,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 12:12:08,654 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1029189765, now seen corresponding path program 3 times [2020-10-16 12:12:08,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:08,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742197708] [2020-10-16 12:12:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:08,974 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2020-10-16 12:12:09,272 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-10-16 12:12:09,422 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2020-10-16 12:12:09,554 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-10-16 12:12:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:09,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742197708] [2020-10-16 12:12:09,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:09,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:12:09,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546566233] [2020-10-16 12:12:09,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:12:09,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:09,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:12:09,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:09,664 INFO L87 Difference]: Start difference. First operand 77 states and 142 transitions. Second operand 11 states. [2020-10-16 12:12:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:10,606 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2020-10-16 12:12:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:12:10,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-16 12:12:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:10,609 INFO L225 Difference]: With dead ends: 108 [2020-10-16 12:12:10,609 INFO L226 Difference]: Without dead ends: 84 [2020-10-16 12:12:10,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2020-10-16 12:12:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-16 12:12:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2020-10-16 12:12:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-16 12:12:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 136 transitions. [2020-10-16 12:12:10,612 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 136 transitions. Word has length 21 [2020-10-16 12:12:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:10,612 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 136 transitions. [2020-10-16 12:12:10,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:12:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 136 transitions. [2020-10-16 12:12:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:10,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:10,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:10,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 12:12:10,613 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1258202069, now seen corresponding path program 4 times [2020-10-16 12:12:10,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:10,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964130005] [2020-10-16 12:12:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:11,127 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2020-10-16 12:12:11,291 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-10-16 12:12:11,431 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2020-10-16 12:12:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:11,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964130005] [2020-10-16 12:12:11,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:11,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:12:11,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119999963] [2020-10-16 12:12:11,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:12:11,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:11,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:12:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:12:11,514 INFO L87 Difference]: Start difference. First operand 74 states and 136 transitions. Second operand 10 states. [2020-10-16 12:12:12,164 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-10-16 12:12:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:12,290 INFO L93 Difference]: Finished difference Result 129 states and 231 transitions. [2020-10-16 12:12:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:12,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-16 12:12:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:12,292 INFO L225 Difference]: With dead ends: 129 [2020-10-16 12:12:12,292 INFO L226 Difference]: Without dead ends: 108 [2020-10-16 12:12:12,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:12:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-16 12:12:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 74. [2020-10-16 12:12:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-16 12:12:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 133 transitions. [2020-10-16 12:12:12,294 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 133 transitions. Word has length 21 [2020-10-16 12:12:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:12,295 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 133 transitions. [2020-10-16 12:12:12,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:12:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 133 transitions. [2020-10-16 12:12:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:12,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:12,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:12,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 12:12:12,296 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash -503555769, now seen corresponding path program 5 times [2020-10-16 12:12:12,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:12,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139126657] [2020-10-16 12:12:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:12,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139126657] [2020-10-16 12:12:12,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:12,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:12:12,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036628102] [2020-10-16 12:12:12,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:12:12,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:12,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:12:12,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:12:12,660 INFO L87 Difference]: Start difference. First operand 74 states and 133 transitions. Second operand 7 states. [2020-10-16 12:12:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:13,121 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2020-10-16 12:12:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:12:13,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:12:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:13,124 INFO L225 Difference]: With dead ends: 96 [2020-10-16 12:12:13,124 INFO L226 Difference]: Without dead ends: 54 [2020-10-16 12:12:13,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-16 12:12:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2020-10-16 12:12:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-16 12:12:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2020-10-16 12:12:13,127 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 21 [2020-10-16 12:12:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:13,128 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2020-10-16 12:12:13,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:12:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2020-10-16 12:12:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:13,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:13,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:13,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 12:12:13,129 INFO L429 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1335276029, now seen corresponding path program 6 times [2020-10-16 12:12:13,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:13,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109036598] [2020-10-16 12:12:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:13,860 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-10-16 12:12:14,107 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-10-16 12:12:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:14,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109036598] [2020-10-16 12:12:14,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:14,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 12:12:14,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684183858] [2020-10-16 12:12:14,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 12:12:14,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 12:12:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:12:14,628 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand 14 states. [2020-10-16 12:12:14,913 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2020-10-16 12:12:15,265 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-16 12:12:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:16,009 INFO L93 Difference]: Finished difference Result 80 states and 125 transitions. [2020-10-16 12:12:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 12:12:16,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-10-16 12:12:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:16,010 INFO L225 Difference]: With dead ends: 80 [2020-10-16 12:12:16,011 INFO L226 Difference]: Without dead ends: 57 [2020-10-16 12:12:16,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-10-16 12:12:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-16 12:12:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2020-10-16 12:12:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-16 12:12:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2020-10-16 12:12:16,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 21 [2020-10-16 12:12:16,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:16,013 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2020-10-16 12:12:16,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 12:12:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2020-10-16 12:12:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:16,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:16,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:16,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 12:12:16,014 INFO L429 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -734477863, now seen corresponding path program 7 times [2020-10-16 12:12:16,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:16,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274584355] [2020-10-16 12:12:16,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:16,483 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2020-10-16 12:12:16,681 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2020-10-16 12:12:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:16,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274584355] [2020-10-16 12:12:16,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:16,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:12:16,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670269958] [2020-10-16 12:12:16,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:12:16,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:12:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:12:16,833 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. Second operand 8 states. [2020-10-16 12:12:16,960 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2020-10-16 12:12:17,453 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-10-16 12:12:17,591 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2020-10-16 12:12:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:17,631 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2020-10-16 12:12:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:17,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-16 12:12:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:17,632 INFO L225 Difference]: With dead ends: 68 [2020-10-16 12:12:17,632 INFO L226 Difference]: Without dead ends: 53 [2020-10-16 12:12:17,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:12:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-16 12:12:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2020-10-16 12:12:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-16 12:12:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-10-16 12:12:17,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 21 [2020-10-16 12:12:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:17,636 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-10-16 12:12:17,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:12:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-10-16 12:12:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:17,637 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:17,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:17,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 12:12:17,637 INFO L429 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -361328219, now seen corresponding path program 8 times [2020-10-16 12:12:17,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:17,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913778329] [2020-10-16 12:12:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:12:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:12:18,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913778329] [2020-10-16 12:12:18,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:12:18,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:12:18,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210898986] [2020-10-16 12:12:18,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:12:18,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:12:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:12:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:12:18,238 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 11 states. [2020-10-16 12:12:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:12:18,737 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2020-10-16 12:12:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:12:18,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-16 12:12:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:12:18,739 INFO L225 Difference]: With dead ends: 67 [2020-10-16 12:12:18,739 INFO L226 Difference]: Without dead ends: 37 [2020-10-16 12:12:18,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:12:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-16 12:12:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-16 12:12:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-16 12:12:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-16 12:12:18,742 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-10-16 12:12:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:12:18,742 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-16 12:12:18,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:12:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-10-16 12:12:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:12:18,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:12:18,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:12:18,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-16 12:12:18,743 INFO L429 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:12:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:12:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 559176997, now seen corresponding path program 9 times [2020-10-16 12:12:18,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:12:18,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886258309] [2020-10-16 12:12:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:12:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:12:18,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:12:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:12:18,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:12:18,924 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:12:18,924 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:12:18,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-16 12:12:18,926 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:12:18,941 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In1734891486 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In1734891486 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1734891486 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In1734891486 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff0_thd0~0_In1734891486 ~x$r_buff0_thd0~0_Out1734891486) (or (and (= ~x$w_buff1_used~0_Out1734891486 0) .cse0 .cse1) (and (= ~x$w_buff1_used~0_In1734891486 ~x$w_buff1_used~0_Out1734891486) .cse2)) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out1734891486)) (or (and (or (and (= ~x~0_In1734891486 ~x~0_Out1734891486) .cse2) (and .cse0 .cse1 (= ~x$w_buff1~0_In1734891486 ~x~0_Out1734891486))) .cse3) (and .cse4 (= ~x$w_buff0~0_In1734891486 ~x~0_Out1734891486) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1734891486 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1734891486|) (= ~x$r_buff1_thd0~0_Out1734891486 ~x$r_buff1_thd0~0_In1734891486) (or (and (= ~x$w_buff0_used~0_Out1734891486 ~x$w_buff0_used~0_In1734891486) .cse3) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out1734891486 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1734891486, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1734891486, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1734891486|, ~x$w_buff1~0=~x$w_buff1~0_In1734891486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734891486, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1734891486, ~x~0=~x~0_In1734891486, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734891486} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1734891486, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1734891486, ~x$w_buff1~0=~x$w_buff1~0_In1734891486, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1734891486, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1734891486|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1734891486, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1734891486, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1734891486|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1734891486|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1734891486|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1734891486|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out1734891486|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1734891486, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1734891486|, ~x~0=~x~0_Out1734891486} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 12:12:18,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,949 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,949 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,956 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,964 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,966 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,967 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:18,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:12:18,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:12:19,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:12:19 BasicIcfg [2020-10-16 12:12:19,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:12:19,035 INFO L168 Benchmark]: Toolchain (without parser) took 38226.78 ms. Allocated memory was 140.0 MB in the beginning and 522.2 MB in the end (delta: 382.2 MB). Free memory was 101.3 MB in the beginning and 114.8 MB in the end (delta: -13.5 MB). Peak memory consumption was 368.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,035 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:12:19,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.14 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 157.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 205.5 MB. Free memory was 157.6 MB in the beginning and 154.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,040 INFO L168 Benchmark]: Boogie Preprocessor took 62.06 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,040 INFO L168 Benchmark]: RCFGBuilder took 3582.76 ms. Allocated memory was 205.5 MB in the beginning and 246.9 MB in the end (delta: 41.4 MB). Free memory was 150.9 MB in the beginning and 92.7 MB in the end (delta: 58.2 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,040 INFO L168 Benchmark]: TraceAbstraction took 33673.71 ms. Allocated memory was 246.9 MB in the beginning and 522.2 MB in the end (delta: 275.3 MB). Free memory was 90.7 MB in the beginning and 114.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 251.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:12:19,042 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.49 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.14 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 101.1 MB in the beginning and 157.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 205.5 MB. Free memory was 157.6 MB in the beginning and 154.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.06 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3582.76 ms. Allocated memory was 205.5 MB in the beginning and 246.9 MB in the end (delta: 41.4 MB). Free memory was 150.9 MB in the beginning and 92.7 MB in the end (delta: 58.2 MB). Peak memory consumption was 102.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33673.71 ms. Allocated memory was 246.9 MB in the beginning and 522.2 MB in the end (delta: 275.3 MB). Free memory was 90.7 MB in the beginning and 114.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 251.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 811 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.7s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 4248 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2537; [L839] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2538; [L841] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L842] 0 pthread_t t2539; [L843] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 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) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] 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) [L764] 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) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 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 [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 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 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 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) [L816] 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) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 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 [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 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 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L787] 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) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] 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) [L787] 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) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 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 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] 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) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] 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) [L860] 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) [L861] 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)) [L861] 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)) [L862] 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)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] 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)) [L862] 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)) [L863] 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)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 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)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] 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)) [L866] 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)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 636 SDtfs, 1139 SDslu, 1529 SDs, 0 SdLazy, 2279 SolverSat, 752 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred 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.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 1868 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 461 ConstructedInterpolants, 0 QuantifiedInterpolants, 160946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...