/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:15:59,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:15:59,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:15:59,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:15:59,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:15:59,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:15:59,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:15:59,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:15:59,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:15:59,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:15:59,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:15:59,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:15:59,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:15:59,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:15:59,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:15:59,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:15:59,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:15:59,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:15:59,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:15:59,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:15:59,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:15:59,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:15:59,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:15:59,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:15:59,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:15:59,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:15:59,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:15:59,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:15:59,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:15:59,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:15:59,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:15:59,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:15:59,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:15:59,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:15:59,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:15:59,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:15:59,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:15:59,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:15:59,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:15:59,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:15:59,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:15:59,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:15:59,846 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:15:59,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:15:59,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:15:59,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:15:59,851 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:15:59,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:15:59,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:15:59,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:15:59,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:15:59,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:15:59,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:15:59,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:15:59,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:15:59,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:15:59,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:15:59,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:15:59,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:15:59,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:15:59,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:15:59,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:15:59,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:15:59,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:15:59,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:15:59,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:15:59,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:15:59,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:15:59,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:15:59,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:15:59,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:16:00,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:16:00,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:16:00,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:16:00,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:16:00,142 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:16:00,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-27 02:16:00,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f2a1541/1aba81a545524eabb8cfe1f84621464e/FLAG5df36c89c [2019-12-27 02:16:00,796 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:16:00,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.oepc.i [2019-12-27 02:16:00,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f2a1541/1aba81a545524eabb8cfe1f84621464e/FLAG5df36c89c [2019-12-27 02:16:01,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f2a1541/1aba81a545524eabb8cfe1f84621464e [2019-12-27 02:16:01,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:16:01,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:16:01,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:16:01,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:16:01,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:16:01,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ece4928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01, skipping insertion in model container [2019-12-27 02:16:01,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:16:01,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:16:01,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:16:01,752 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:16:01,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:16:01,902 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:16:01,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01 WrapperNode [2019-12-27 02:16:01,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:16:01,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:16:01,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:16:01,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:16:01,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:16:01,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:16:01,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:16:01,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:16:01,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:01,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:02,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:02,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... [2019-12-27 02:16:02,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:16:02,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:16:02,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:16:02,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:16:02,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:16:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:16:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:16:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:16:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:16:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:16:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:16:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:16:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:16:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:16:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:16:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:16:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:16:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:16:02,094 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:16:02,878 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:16:02,878 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:16:02,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:16:02 BoogieIcfgContainer [2019-12-27 02:16:02,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:16:02,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:16:02,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:16:02,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:16:02,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:16:01" (1/3) ... [2019-12-27 02:16:02,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eebbaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:16:02, skipping insertion in model container [2019-12-27 02:16:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:01" (2/3) ... [2019-12-27 02:16:02,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eebbaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:16:02, skipping insertion in model container [2019-12-27 02:16:02,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:16:02" (3/3) ... [2019-12-27 02:16:02,889 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-27 02:16:02,900 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:16:02,900 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:16:02,909 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:16:02,909 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:16:02,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,952 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,952 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,953 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,987 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:02,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,012 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,013 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,021 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:03,043 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:16:03,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:16:03,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:16:03,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:16:03,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:16:03,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:16:03,065 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:16:03,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:16:03,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:16:03,082 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 02:16:03,084 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 02:16:03,192 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 02:16:03,192 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:16:03,209 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:16:03,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 02:16:03,290 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 02:16:03,290 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:16:03,299 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:16:03,320 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:16:03,321 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:16:08,825 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 02:16:08,972 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 02:16:09,004 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 02:16:09,004 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 02:16:09,008 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 02:16:31,593 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 02:16:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 02:16:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:16:31,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:16:31,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:16:31,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:16:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:16:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 02:16:31,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:16:31,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804599711] [2019-12-27 02:16:31,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:16:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:16:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:16:31,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804599711] [2019-12-27 02:16:31,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:16:31,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:16:31,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481542612] [2019-12-27 02:16:31,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:16:31,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:16:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:16:31,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:16:31,928 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 02:16:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:16:36,240 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 02:16:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:16:36,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:16:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:16:36,961 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 02:16:36,961 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 02:16:36,963 INFO L631 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 [2019-12-27 02:16:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 02:16:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 02:16:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 02:16:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 02:16:47,960 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 02:16:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:16:47,960 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 02:16:47,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:16:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 02:16:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:16:47,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:16:47,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:16:47,965 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:16:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:16:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 02:16:47,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:16:47,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060458745] [2019-12-27 02:16:47,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:16:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:16:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:16:48,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060458745] [2019-12-27 02:16:48,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:16:48,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:16:48,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45018514] [2019-12-27 02:16:48,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:16:48,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:16:48,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:16:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:16:48,083 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 02:16:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:16:54,139 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 02:16:54,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:16:54,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:16:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:16:54,964 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 02:16:54,964 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 02:16:54,966 INFO L631 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 [2019-12-27 02:17:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 02:17:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 02:17:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 02:17:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 02:17:06,520 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 02:17:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:06,520 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 02:17:06,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 02:17:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:17:06,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:06,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:06,526 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 02:17:06,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:06,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67651371] [2019-12-27 02:17:06,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:06,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67651371] [2019-12-27 02:17:06,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:06,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:06,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256414535] [2019-12-27 02:17:06,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:06,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:06,580 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 02:17:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:06,723 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 02:17:06,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:06,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:17:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:06,795 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 02:17:06,795 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 02:17:06,795 INFO L631 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 [2019-12-27 02:17:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 02:17:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 02:17:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 02:17:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 02:17:13,417 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 02:17:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:13,417 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 02:17:13,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 02:17:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:17:13,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:13,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:13,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 02:17:13,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:13,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620831221] [2019-12-27 02:17:13,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:13,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620831221] [2019-12-27 02:17:13,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:13,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:13,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851139917] [2019-12-27 02:17:13,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:13,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:13,543 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 02:17:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:14,093 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 02:17:14,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:17:14,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:17:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:14,174 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 02:17:14,174 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 02:17:14,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 02:17:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 02:17:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 02:17:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 02:17:15,044 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 02:17:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:15,045 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 02:17:15,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 02:17:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:17:15,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:15,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:15,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 02:17:15,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:15,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158861111] [2019-12-27 02:17:15,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:15,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158861111] [2019-12-27 02:17:15,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:15,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:15,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396808640] [2019-12-27 02:17:15,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:17:15,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:15,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:17:15,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:15,153 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-27 02:17:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:16,360 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 02:17:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:17:16,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:17:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:16,470 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 02:17:16,471 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 02:17:16,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:17:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 02:17:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 02:17:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 02:17:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 02:17:17,421 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 02:17:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:17,421 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 02:17:17,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:17:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 02:17:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:17:17,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:17,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:17,437 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 02:17:17,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:17,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961667288] [2019-12-27 02:17:17,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:17,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961667288] [2019-12-27 02:17:17,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:17,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:17,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085366598] [2019-12-27 02:17:17,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:17,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:17,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:17,492 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-27 02:17:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:17,558 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 02:17:17,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:17,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:17:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:17,594 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 02:17:17,594 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 02:17:17,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 02:17:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 02:17:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 02:17:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 02:17:17,877 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 02:17:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:17,878 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 02:17:17,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 02:17:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:17:17,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:17,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:17,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 02:17:17,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:17,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775936562] [2019-12-27 02:17:17,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:17,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775936562] [2019-12-27 02:17:17,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:17,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:17,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110926988] [2019-12-27 02:17:17,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:17,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:17,946 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 02:17:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:18,160 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 02:17:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:18,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:17:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:18,191 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 02:17:18,191 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 02:17:18,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 02:17:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 02:17:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 02:17:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 02:17:18,501 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 02:17:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:18,501 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 02:17:18,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 02:17:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:17:18,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:18,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:18,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:18,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 02:17:18,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:18,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644917990] [2019-12-27 02:17:18,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:18,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644917990] [2019-12-27 02:17:18,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:18,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:18,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468376406] [2019-12-27 02:17:18,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:17:18,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:17:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:18,626 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 02:17:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:19,210 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 02:17:19,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:17:19,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:17:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:19,246 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 02:17:19,247 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 02:17:19,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 02:17:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 02:17:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 02:17:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 02:17:19,586 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 02:17:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:19,587 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 02:17:19,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:17:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 02:17:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:17:19,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:19,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:19,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 02:17:19,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:19,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098430067] [2019-12-27 02:17:19,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:19,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098430067] [2019-12-27 02:17:19,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:19,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:17:19,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056236454] [2019-12-27 02:17:19,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:19,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:19,732 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-27 02:17:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:20,932 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 02:17:20,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:17:20,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:17:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:20,976 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 02:17:20,976 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 02:17:20,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:17:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 02:17:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 02:17:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 02:17:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 02:17:21,496 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 02:17:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:21,496 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 02:17:21,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 02:17:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:17:21,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:21,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:21,521 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 02:17:21,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:21,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410629706] [2019-12-27 02:17:21,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:21,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410629706] [2019-12-27 02:17:21,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:21,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:21,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440404926] [2019-12-27 02:17:21,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:21,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:21,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:21,591 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-27 02:17:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:21,716 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 02:17:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:21,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 02:17:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:21,740 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 02:17:21,740 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 02:17:21,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 02:17:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 02:17:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 02:17:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 02:17:21,993 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 02:17:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:21,993 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 02:17:21,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 02:17:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:17:22,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:22,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:22,014 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 02:17:22,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:22,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089468567] [2019-12-27 02:17:22,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:22,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089468567] [2019-12-27 02:17:22,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:22,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:17:22,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83275588] [2019-12-27 02:17:22,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:22,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:22,080 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 02:17:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:22,142 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 02:17:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:22,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:17:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:22,168 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 02:17:22,168 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 02:17:22,169 INFO L631 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 [2019-12-27 02:17:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 02:17:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 02:17:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 02:17:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 02:17:22,404 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 02:17:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:22,404 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 02:17:22,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 02:17:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:17:22,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:22,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:22,420 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 02:17:22,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:22,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097783293] [2019-12-27 02:17:22,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:22,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097783293] [2019-12-27 02:17:22,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:22,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:22,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411556583] [2019-12-27 02:17:22,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:22,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:22,488 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-27 02:17:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:22,591 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-27 02:17:22,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:22,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 02:17:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:22,614 INFO L225 Difference]: With dead ends: 26060 [2019-12-27 02:17:22,615 INFO L226 Difference]: Without dead ends: 11670 [2019-12-27 02:17:22,615 INFO L631 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 [2019-12-27 02:17:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-27 02:17:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-27 02:17:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 02:17:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 02:17:22,855 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 02:17:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:22,855 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 02:17:22,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 02:17:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:17:22,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:22,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:22,866 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 02:17:22,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:22,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261102630] [2019-12-27 02:17:22,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:22,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261102630] [2019-12-27 02:17:22,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:22,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:22,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473548834] [2019-12-27 02:17:22,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:22,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:22,924 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-27 02:17:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:22,990 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 02:17:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:17:22,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:17:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:23,006 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 02:17:23,006 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 02:17:23,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 02:17:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 02:17:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 02:17:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 02:17:23,274 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 02:17:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:23,274 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 02:17:23,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 02:17:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:23,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:23,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:23,285 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:23,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 02:17:23,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:23,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770342218] [2019-12-27 02:17:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:23,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770342218] [2019-12-27 02:17:23,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:23,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:23,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561481513] [2019-12-27 02:17:23,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:23,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:23,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:23,342 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 02:17:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:23,415 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 02:17:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:23,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:17:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:23,435 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 02:17:23,435 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 02:17:23,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 02:17:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 02:17:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 02:17:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 02:17:23,603 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 02:17:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:23,603 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 02:17:23,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 02:17:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:23,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:23,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:23,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:23,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 02:17:23,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:23,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519551020] [2019-12-27 02:17:23,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:23,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519551020] [2019-12-27 02:17:23,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:23,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:23,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195379117] [2019-12-27 02:17:23,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:23,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:23,705 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-27 02:17:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:24,021 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-27 02:17:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:17:24,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:17:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:24,043 INFO L225 Difference]: With dead ends: 15437 [2019-12-27 02:17:24,043 INFO L226 Difference]: Without dead ends: 11573 [2019-12-27 02:17:24,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:17:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-27 02:17:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-27 02:17:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 02:17:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 02:17:24,252 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 02:17:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:24,253 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 02:17:24,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 02:17:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:24,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:24,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:24,263 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:24,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 02:17:24,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:24,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579555551] [2019-12-27 02:17:24,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:24,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579555551] [2019-12-27 02:17:24,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:24,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:24,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725507548] [2019-12-27 02:17:24,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:24,375 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-27 02:17:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:24,732 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-27 02:17:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:17:24,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:17:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:24,761 INFO L225 Difference]: With dead ends: 17385 [2019-12-27 02:17:24,761 INFO L226 Difference]: Without dead ends: 13105 [2019-12-27 02:17:24,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:17:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-27 02:17:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-27 02:17:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-27 02:17:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-27 02:17:25,048 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-27 02:17:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:25,048 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-27 02:17:25,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-27 02:17:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:25,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:25,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:25,064 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 02:17:25,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:25,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734062309] [2019-12-27 02:17:25,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:25,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734062309] [2019-12-27 02:17:25,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:25,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444628181] [2019-12-27 02:17:25,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:25,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:25,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:25,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:25,185 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-27 02:17:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:26,152 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-27 02:17:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 02:17:26,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:17:26,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:26,182 INFO L225 Difference]: With dead ends: 24832 [2019-12-27 02:17:26,183 INFO L226 Difference]: Without dead ends: 22344 [2019-12-27 02:17:26,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:17:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-27 02:17:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-27 02:17:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-27 02:17:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-27 02:17:26,450 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-27 02:17:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:26,450 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-27 02:17:26,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-27 02:17:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:26,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:26,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:26,463 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:26,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-27 02:17:26,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:26,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521485170] [2019-12-27 02:17:26,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:26,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521485170] [2019-12-27 02:17:26,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:26,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:26,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902166613] [2019-12-27 02:17:26,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:26,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:26,598 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-27 02:17:26,755 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-12-27 02:17:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:27,824 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-27 02:17:27,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:17:27,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:17:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:27,873 INFO L225 Difference]: With dead ends: 28772 [2019-12-27 02:17:27,873 INFO L226 Difference]: Without dead ends: 26348 [2019-12-27 02:17:27,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:17:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-27 02:17:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-27 02:17:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-27 02:17:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-27 02:17:28,181 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-27 02:17:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:28,182 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-27 02:17:28,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-27 02:17:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:28,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:28,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:28,193 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-27 02:17:28,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:28,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016126209] [2019-12-27 02:17:28,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:28,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016126209] [2019-12-27 02:17:28,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:28,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:28,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701125025] [2019-12-27 02:17:28,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:28,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:28,258 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-27 02:17:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:28,342 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-27 02:17:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:28,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:17:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:28,358 INFO L225 Difference]: With dead ends: 12322 [2019-12-27 02:17:28,358 INFO L226 Difference]: Without dead ends: 12322 [2019-12-27 02:17:28,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-27 02:17:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-27 02:17:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-27 02:17:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-27 02:17:28,538 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-27 02:17:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:28,538 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-27 02:17:28,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-27 02:17:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:28,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:28,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:28,550 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 02:17:28,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:28,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425849549] [2019-12-27 02:17:28,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:28,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425849549] [2019-12-27 02:17:28,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:28,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:17:28,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386509574] [2019-12-27 02:17:28,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:17:28,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:28,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:17:28,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:17:28,645 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-27 02:17:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:29,433 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-27 02:17:29,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:17:29,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:17:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:29,471 INFO L225 Difference]: With dead ends: 29477 [2019-12-27 02:17:29,471 INFO L226 Difference]: Without dead ends: 26544 [2019-12-27 02:17:29,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:17:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-27 02:17:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-27 02:17:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-27 02:17:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-27 02:17:29,766 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-27 02:17:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:29,767 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-27 02:17:29,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:17:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-27 02:17:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:29,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:29,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:29,780 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 02:17:29,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:29,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221127893] [2019-12-27 02:17:29,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221127893] [2019-12-27 02:17:29,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:29,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:29,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924560522] [2019-12-27 02:17:29,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:29,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:29,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:29,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:29,902 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-27 02:17:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:30,926 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-27 02:17:30,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:17:30,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:17:30,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:30,967 INFO L225 Difference]: With dead ends: 32061 [2019-12-27 02:17:30,967 INFO L226 Difference]: Without dead ends: 29128 [2019-12-27 02:17:30,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:17:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-27 02:17:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-27 02:17:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-27 02:17:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-27 02:17:31,287 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-27 02:17:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:31,288 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-27 02:17:31,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-27 02:17:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:31,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:31,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:31,307 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-27 02:17:31,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:31,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291357693] [2019-12-27 02:17:31,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:31,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291357693] [2019-12-27 02:17:31,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:31,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:31,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889648009] [2019-12-27 02:17:31,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:31,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:31,422 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-27 02:17:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:32,712 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-27 02:17:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:17:32,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:17:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:32,775 INFO L225 Difference]: With dead ends: 33909 [2019-12-27 02:17:32,775 INFO L226 Difference]: Without dead ends: 30991 [2019-12-27 02:17:32,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:17:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-27 02:17:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-27 02:17:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-27 02:17:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-27 02:17:33,187 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-27 02:17:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:33,187 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-27 02:17:33,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-27 02:17:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:33,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:33,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:33,202 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-27 02:17:33,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:33,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613067278] [2019-12-27 02:17:33,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:33,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613067278] [2019-12-27 02:17:33,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:33,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:33,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387247532] [2019-12-27 02:17:33,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:33,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:33,271 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-27 02:17:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:33,404 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-27 02:17:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:33,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:17:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:33,428 INFO L225 Difference]: With dead ends: 11142 [2019-12-27 02:17:33,428 INFO L226 Difference]: Without dead ends: 11142 [2019-12-27 02:17:33,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-27 02:17:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-27 02:17:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-27 02:17:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-27 02:17:33,665 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-27 02:17:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:33,666 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-27 02:17:33,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-27 02:17:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:33,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:33,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:33,679 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:33,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 02:17:33,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:33,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999945297] [2019-12-27 02:17:33,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:34,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999945297] [2019-12-27 02:17:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:34,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 02:17:34,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244165264] [2019-12-27 02:17:34,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:17:34,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:34,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:17:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:17:34,130 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 13 states. [2019-12-27 02:17:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:36,462 INFO L93 Difference]: Finished difference Result 22715 states and 68161 transitions. [2019-12-27 02:17:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 02:17:36,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 02:17:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:36,492 INFO L225 Difference]: With dead ends: 22715 [2019-12-27 02:17:36,492 INFO L226 Difference]: Without dead ends: 22463 [2019-12-27 02:17:36,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-27 02:17:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22463 states. [2019-12-27 02:17:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22463 to 16636. [2019-12-27 02:17:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16636 states. [2019-12-27 02:17:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16636 states to 16636 states and 50248 transitions. [2019-12-27 02:17:36,795 INFO L78 Accepts]: Start accepts. Automaton has 16636 states and 50248 transitions. Word has length 65 [2019-12-27 02:17:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:36,795 INFO L462 AbstractCegarLoop]: Abstraction has 16636 states and 50248 transitions. [2019-12-27 02:17:36,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:17:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 16636 states and 50248 transitions. [2019-12-27 02:17:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:36,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:36,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:36,812 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:36,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash -130492415, now seen corresponding path program 2 times [2019-12-27 02:17:36,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:36,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105844034] [2019-12-27 02:17:36,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:37,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105844034] [2019-12-27 02:17:37,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:37,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:17:37,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195399330] [2019-12-27 02:17:37,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:37,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:37,072 INFO L87 Difference]: Start difference. First operand 16636 states and 50248 transitions. Second operand 11 states. [2019-12-27 02:17:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:39,061 INFO L93 Difference]: Finished difference Result 29228 states and 85442 transitions. [2019-12-27 02:17:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:17:39,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 02:17:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:39,099 INFO L225 Difference]: With dead ends: 29228 [2019-12-27 02:17:39,099 INFO L226 Difference]: Without dead ends: 29008 [2019-12-27 02:17:39,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:17:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29008 states. [2019-12-27 02:17:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29008 to 18823. [2019-12-27 02:17:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18823 states. [2019-12-27 02:17:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18823 states to 18823 states and 55851 transitions. [2019-12-27 02:17:39,457 INFO L78 Accepts]: Start accepts. Automaton has 18823 states and 55851 transitions. Word has length 65 [2019-12-27 02:17:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:39,457 INFO L462 AbstractCegarLoop]: Abstraction has 18823 states and 55851 transitions. [2019-12-27 02:17:39,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18823 states and 55851 transitions. [2019-12-27 02:17:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:39,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:39,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:39,476 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:39,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1979760167, now seen corresponding path program 3 times [2019-12-27 02:17:39,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:39,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456271274] [2019-12-27 02:17:39,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:39,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456271274] [2019-12-27 02:17:39,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:39,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:39,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518350270] [2019-12-27 02:17:39,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:39,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:39,553 INFO L87 Difference]: Start difference. First operand 18823 states and 55851 transitions. Second operand 3 states. [2019-12-27 02:17:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:39,607 INFO L93 Difference]: Finished difference Result 11906 states and 35109 transitions. [2019-12-27 02:17:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:39,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:17:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:39,627 INFO L225 Difference]: With dead ends: 11906 [2019-12-27 02:17:39,628 INFO L226 Difference]: Without dead ends: 11906 [2019-12-27 02:17:39,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2019-12-27 02:17:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 11430. [2019-12-27 02:17:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11430 states. [2019-12-27 02:17:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11430 states to 11430 states and 33671 transitions. [2019-12-27 02:17:40,011 INFO L78 Accepts]: Start accepts. Automaton has 11430 states and 33671 transitions. Word has length 65 [2019-12-27 02:17:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:40,011 INFO L462 AbstractCegarLoop]: Abstraction has 11430 states and 33671 transitions. [2019-12-27 02:17:40,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 11430 states and 33671 transitions. [2019-12-27 02:17:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:40,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:40,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:40,033 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1324094588, now seen corresponding path program 1 times [2019-12-27 02:17:40,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:40,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192717104] [2019-12-27 02:17:40,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:40,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192717104] [2019-12-27 02:17:40,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:40,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285485844] [2019-12-27 02:17:40,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:17:40,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:17:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:40,559 INFO L87 Difference]: Start difference. First operand 11430 states and 33671 transitions. Second operand 10 states. [2019-12-27 02:17:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:41,696 INFO L93 Difference]: Finished difference Result 20680 states and 60203 transitions. [2019-12-27 02:17:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:17:41,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:17:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:41,719 INFO L225 Difference]: With dead ends: 20680 [2019-12-27 02:17:41,719 INFO L226 Difference]: Without dead ends: 15195 [2019-12-27 02:17:41,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:17:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15195 states. [2019-12-27 02:17:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15195 to 11764. [2019-12-27 02:17:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11764 states. [2019-12-27 02:17:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 34473 transitions. [2019-12-27 02:17:41,944 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 34473 transitions. Word has length 66 [2019-12-27 02:17:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:41,944 INFO L462 AbstractCegarLoop]: Abstraction has 11764 states and 34473 transitions. [2019-12-27 02:17:41,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:17:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 34473 transitions. [2019-12-27 02:17:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:41,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:41,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:41,957 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1320774952, now seen corresponding path program 2 times [2019-12-27 02:17:41,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:41,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775959416] [2019-12-27 02:17:41,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:42,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775959416] [2019-12-27 02:17:42,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:42,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:42,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724465801] [2019-12-27 02:17:42,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:17:42,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:42,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:17:42,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:42,145 INFO L87 Difference]: Start difference. First operand 11764 states and 34473 transitions. Second operand 10 states. [2019-12-27 02:17:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:43,500 INFO L93 Difference]: Finished difference Result 20229 states and 58275 transitions. [2019-12-27 02:17:43,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:17:43,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 02:17:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:43,523 INFO L225 Difference]: With dead ends: 20229 [2019-12-27 02:17:43,523 INFO L226 Difference]: Without dead ends: 16412 [2019-12-27 02:17:43,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:17:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16412 states. [2019-12-27 02:17:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16412 to 12150. [2019-12-27 02:17:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12150 states. [2019-12-27 02:17:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12150 states to 12150 states and 35388 transitions. [2019-12-27 02:17:43,749 INFO L78 Accepts]: Start accepts. Automaton has 12150 states and 35388 transitions. Word has length 66 [2019-12-27 02:17:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:43,749 INFO L462 AbstractCegarLoop]: Abstraction has 12150 states and 35388 transitions. [2019-12-27 02:17:43,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:17:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12150 states and 35388 transitions. [2019-12-27 02:17:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:43,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:43,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:43,762 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -961619660, now seen corresponding path program 3 times [2019-12-27 02:17:43,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:43,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511229309] [2019-12-27 02:17:43,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:43,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511229309] [2019-12-27 02:17:43,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:43,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:43,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615350724] [2019-12-27 02:17:43,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:43,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:43,935 INFO L87 Difference]: Start difference. First operand 12150 states and 35388 transitions. Second operand 11 states. [2019-12-27 02:17:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:45,357 INFO L93 Difference]: Finished difference Result 19486 states and 55988 transitions. [2019-12-27 02:17:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:17:45,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:17:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:45,379 INFO L225 Difference]: With dead ends: 19486 [2019-12-27 02:17:45,379 INFO L226 Difference]: Without dead ends: 15946 [2019-12-27 02:17:45,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:17:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15946 states. [2019-12-27 02:17:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15946 to 11811. [2019-12-27 02:17:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11811 states. [2019-12-27 02:17:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 34424 transitions. [2019-12-27 02:17:45,594 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 34424 transitions. Word has length 66 [2019-12-27 02:17:45,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:45,594 INFO L462 AbstractCegarLoop]: Abstraction has 11811 states and 34424 transitions. [2019-12-27 02:17:45,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 34424 transitions. [2019-12-27 02:17:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:45,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:45,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:45,607 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1444762494, now seen corresponding path program 4 times [2019-12-27 02:17:45,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:45,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808796077] [2019-12-27 02:17:45,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:45,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808796077] [2019-12-27 02:17:45,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:45,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:45,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340596295] [2019-12-27 02:17:45,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:45,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:45,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:45,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:45,784 INFO L87 Difference]: Start difference. First operand 11811 states and 34424 transitions. Second operand 11 states. [2019-12-27 02:17:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:46,592 INFO L93 Difference]: Finished difference Result 17754 states and 51462 transitions. [2019-12-27 02:17:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:17:46,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:17:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:46,614 INFO L225 Difference]: With dead ends: 17754 [2019-12-27 02:17:46,615 INFO L226 Difference]: Without dead ends: 16229 [2019-12-27 02:17:46,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:17:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16229 states. [2019-12-27 02:17:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16229 to 13519. [2019-12-27 02:17:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13519 states. [2019-12-27 02:17:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13519 states to 13519 states and 39339 transitions. [2019-12-27 02:17:46,848 INFO L78 Accepts]: Start accepts. Automaton has 13519 states and 39339 transitions. Word has length 66 [2019-12-27 02:17:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:46,848 INFO L462 AbstractCegarLoop]: Abstraction has 13519 states and 39339 transitions. [2019-12-27 02:17:46,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 13519 states and 39339 transitions. [2019-12-27 02:17:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:46,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:46,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:46,862 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash -681492930, now seen corresponding path program 5 times [2019-12-27 02:17:46,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:46,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362455098] [2019-12-27 02:17:46,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:47,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362455098] [2019-12-27 02:17:47,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:47,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:47,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288783272] [2019-12-27 02:17:47,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:47,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:47,020 INFO L87 Difference]: Start difference. First operand 13519 states and 39339 transitions. Second operand 11 states. [2019-12-27 02:17:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:47,798 INFO L93 Difference]: Finished difference Result 16845 states and 48327 transitions. [2019-12-27 02:17:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:17:47,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 02:17:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:47,819 INFO L225 Difference]: With dead ends: 16845 [2019-12-27 02:17:47,820 INFO L226 Difference]: Without dead ends: 14500 [2019-12-27 02:17:47,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:17:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14500 states. [2019-12-27 02:17:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14500 to 11389. [2019-12-27 02:17:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11389 states. [2019-12-27 02:17:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11389 states to 11389 states and 33167 transitions. [2019-12-27 02:17:48,037 INFO L78 Accepts]: Start accepts. Automaton has 11389 states and 33167 transitions. Word has length 66 [2019-12-27 02:17:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:48,037 INFO L462 AbstractCegarLoop]: Abstraction has 11389 states and 33167 transitions. [2019-12-27 02:17:48,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 11389 states and 33167 transitions. [2019-12-27 02:17:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:48,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:48,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:48,049 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:48,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:48,050 INFO L82 PathProgramCache]: Analyzing trace with hash -336670156, now seen corresponding path program 6 times [2019-12-27 02:17:48,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:48,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481473314] [2019-12-27 02:17:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:48,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481473314] [2019-12-27 02:17:48,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:48,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:48,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39711197] [2019-12-27 02:17:48,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:48,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:48,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:48,113 INFO L87 Difference]: Start difference. First operand 11389 states and 33167 transitions. Second operand 3 states. [2019-12-27 02:17:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:48,160 INFO L93 Difference]: Finished difference Result 11388 states and 33165 transitions. [2019-12-27 02:17:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:48,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:17:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:48,174 INFO L225 Difference]: With dead ends: 11388 [2019-12-27 02:17:48,174 INFO L226 Difference]: Without dead ends: 11388 [2019-12-27 02:17:48,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11388 states. [2019-12-27 02:17:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11388 to 9629. [2019-12-27 02:17:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9629 states. [2019-12-27 02:17:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9629 states to 9629 states and 28225 transitions. [2019-12-27 02:17:48,337 INFO L78 Accepts]: Start accepts. Automaton has 9629 states and 28225 transitions. Word has length 66 [2019-12-27 02:17:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:48,337 INFO L462 AbstractCegarLoop]: Abstraction has 9629 states and 28225 transitions. [2019-12-27 02:17:48,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 9629 states and 28225 transitions. [2019-12-27 02:17:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:48,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:48,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:48,347 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 1 times [2019-12-27 02:17:48,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:48,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258196754] [2019-12-27 02:17:48,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:48,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258196754] [2019-12-27 02:17:48,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:48,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 02:17:48,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809706392] [2019-12-27 02:17:48,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 02:17:48,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 02:17:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:17:48,760 INFO L87 Difference]: Start difference. First operand 9629 states and 28225 transitions. Second operand 17 states. [2019-12-27 02:17:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:50,498 INFO L93 Difference]: Finished difference Result 9964 states and 28511 transitions. [2019-12-27 02:17:50,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 02:17:50,500 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 02:17:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:50,514 INFO L225 Difference]: With dead ends: 9964 [2019-12-27 02:17:50,514 INFO L226 Difference]: Without dead ends: 9853 [2019-12-27 02:17:50,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 02:17:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9853 states. [2019-12-27 02:17:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9853 to 9026. [2019-12-27 02:17:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9026 states. [2019-12-27 02:17:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9026 states to 9026 states and 26151 transitions. [2019-12-27 02:17:50,667 INFO L78 Accepts]: Start accepts. Automaton has 9026 states and 26151 transitions. Word has length 67 [2019-12-27 02:17:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:50,667 INFO L462 AbstractCegarLoop]: Abstraction has 9026 states and 26151 transitions. [2019-12-27 02:17:50,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 02:17:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9026 states and 26151 transitions. [2019-12-27 02:17:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:50,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:50,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:50,678 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 187570937, now seen corresponding path program 2 times [2019-12-27 02:17:50,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:50,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523267563] [2019-12-27 02:17:50,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:50,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523267563] [2019-12-27 02:17:50,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:50,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:50,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488146303] [2019-12-27 02:17:50,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:50,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:50,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:50,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:50,953 INFO L87 Difference]: Start difference. First operand 9026 states and 26151 transitions. Second operand 11 states. [2019-12-27 02:17:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:51,655 INFO L93 Difference]: Finished difference Result 11189 states and 31998 transitions. [2019-12-27 02:17:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:17:51,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:17:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:51,670 INFO L225 Difference]: With dead ends: 11189 [2019-12-27 02:17:51,671 INFO L226 Difference]: Without dead ends: 10934 [2019-12-27 02:17:51,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:17:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-12-27 02:17:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 8750. [2019-12-27 02:17:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-27 02:17:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 25470 transitions. [2019-12-27 02:17:51,816 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 25470 transitions. Word has length 67 [2019-12-27 02:17:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:51,817 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 25470 transitions. [2019-12-27 02:17:51,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 25470 transitions. [2019-12-27 02:17:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:51,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:51,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:51,826 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 3 times [2019-12-27 02:17:51,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:51,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090813469] [2019-12-27 02:17:51,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:17:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:17:51,977 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:17:51,977 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:17:51,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 02:17:51,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-27 02:17:51,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-27 02:17:51,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff1_thd3~0_Out-1641940957 ~b$r_buff0_thd3~0_In-1641940957) (= ~b$r_buff1_thd1~0_Out-1641940957 ~b$r_buff0_thd1~0_In-1641940957) (= ~__unbuffered_p0_EAX~0_Out-1641940957 ~x~0_In-1641940957) (= ~b$r_buff0_thd0~0_In-1641940957 ~b$r_buff1_thd0~0_Out-1641940957) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1641940957)) (= ~b$r_buff0_thd1~0_Out-1641940957 1) (= ~b$r_buff0_thd2~0_In-1641940957 ~b$r_buff1_thd2~0_Out-1641940957)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1641940957, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1641940957, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1641940957, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1641940957, ~x~0=~x~0_In-1641940957, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1641940957} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1641940957, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1641940957, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1641940957, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1641940957, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1641940957, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1641940957, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1641940957, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1641940957, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1641940957, ~x~0=~x~0_In-1641940957, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1641940957} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 02:17:51,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1704765362 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1704765362 256)))) (or (and (or .cse0 .cse1) (= ~b~0_In1704765362 |P1Thread1of1ForFork0_#t~ite9_Out1704765362|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1704765362| ~b$w_buff1~0_In1704765362)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1704765362, ~b~0=~b~0_In1704765362, ~b$w_buff1~0=~b$w_buff1~0_In1704765362, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1704765362} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1704765362, ~b~0=~b~0_In1704765362, ~b$w_buff1~0=~b$w_buff1~0_In1704765362, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1704765362|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1704765362} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:17:51,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:17:51,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1118730586 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-1118730586 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-1118730586| ~b$w_buff0_used~0_In-1118730586)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out-1118730586| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1118730586, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1118730586} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1118730586, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1118730586, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1118730586|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 02:17:51,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1361796959 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-1361796959 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd2~0_In-1361796959 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1361796959 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite12_Out-1361796959| ~b$w_buff1_used~0_In-1361796959)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-1361796959|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1361796959, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1361796959, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1361796959, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1361796959} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1361796959, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1361796959, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1361796959, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1361796959|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1361796959} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:17:51,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-861339599 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-861339599 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In-861339599 |P1Thread1of1ForFork0_#t~ite13_Out-861339599|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out-861339599|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-861339599, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-861339599} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-861339599, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-861339599, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-861339599|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 02:17:51,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In-275313813 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd2~0_In-275313813 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-275313813 256))) (.cse1 (= (mod ~b$r_buff0_thd2~0_In-275313813 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-275313813|)) (and (= ~b$r_buff1_thd2~0_In-275313813 |P1Thread1of1ForFork0_#t~ite14_Out-275313813|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-275313813, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-275313813, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-275313813, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-275313813} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-275313813, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-275313813, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-275313813, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-275313813|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-275313813} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:17:51,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 02:17:51,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1476025323 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In1476025323 256) 0))) (or (and (= (mod ~b$w_buff1_used~0_In1476025323 256) 0) .cse1) (and .cse1 (= (mod ~b$r_buff1_thd3~0_In1476025323 256) 0)) (= (mod ~b$w_buff0_used~0_In1476025323 256) 0))) (= ~b$w_buff0~0_In1476025323 |P2Thread1of1ForFork1_#t~ite20_Out1476025323|) (= |P2Thread1of1ForFork1_#t~ite20_Out1476025323| |P2Thread1of1ForFork1_#t~ite21_Out1476025323|)) (and (= ~b$w_buff0~0_In1476025323 |P2Thread1of1ForFork1_#t~ite21_Out1476025323|) (= |P2Thread1of1ForFork1_#t~ite20_In1476025323| |P2Thread1of1ForFork1_#t~ite20_Out1476025323|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1476025323, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1476025323, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1476025323|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1476025323, ~b$w_buff0~0=~b$w_buff0~0_In1476025323, ~weak$$choice2~0=~weak$$choice2~0_In1476025323, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1476025323} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1476025323, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1476025323, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1476025323|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1476025323|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1476025323, ~b$w_buff0~0=~b$w_buff0~0_In1476025323, ~weak$$choice2~0=~weak$$choice2~0_In1476025323, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1476025323} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:17:52,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In397014032 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite27_Out397014032| |P2Thread1of1ForFork1_#t~ite26_Out397014032|) (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In397014032 256) 0))) (or (and .cse0 (= (mod ~b$w_buff1_used~0_In397014032 256) 0)) (and .cse0 (= 0 (mod ~b$r_buff1_thd3~0_In397014032 256))) (= 0 (mod ~b$w_buff0_used~0_In397014032 256)))) (= ~b$w_buff0_used~0_In397014032 |P2Thread1of1ForFork1_#t~ite26_Out397014032|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite26_In397014032| |P2Thread1of1ForFork1_#t~ite26_Out397014032|) (= ~b$w_buff0_used~0_In397014032 |P2Thread1of1ForFork1_#t~ite27_Out397014032|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In397014032, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In397014032, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In397014032|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In397014032, ~weak$$choice2~0=~weak$$choice2~0_In397014032, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In397014032} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In397014032, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out397014032|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In397014032, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out397014032|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In397014032, ~weak$$choice2~0=~weak$$choice2~0_In397014032, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In397014032} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 02:17:52,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:17:52,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 02:17:52,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1692962829 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1692962829 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1692962829| ~b~0_In-1692962829)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1692962829| ~b$w_buff1~0_In-1692962829) (not .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1692962829, ~b~0=~b~0_In-1692962829, ~b$w_buff1~0=~b$w_buff1~0_In-1692962829, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1692962829} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1692962829|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1692962829, ~b~0=~b~0_In-1692962829, ~b$w_buff1~0=~b$w_buff1~0_In-1692962829, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1692962829} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 02:17:52,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 02:17:52,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-791506063 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-791506063 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out-791506063| 0) (not .cse1)) (and (= ~b$w_buff0_used~0_In-791506063 |P2Thread1of1ForFork1_#t~ite40_Out-791506063|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-791506063, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-791506063} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-791506063, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-791506063, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-791506063|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 02:17:52,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In937286768 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd3~0_In937286768 256) 0)) (.cse2 (= (mod ~b$w_buff0_used~0_In937286768 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd3~0_In937286768 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out937286768| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite41_Out937286768| ~b$w_buff1_used~0_In937286768) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In937286768, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In937286768, ~b$w_buff1_used~0=~b$w_buff1_used~0_In937286768, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In937286768} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In937286768, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In937286768, ~b$w_buff1_used~0=~b$w_buff1_used~0_In937286768, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out937286768|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In937286768} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 02:17:52,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-165302755 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-165302755 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-165302755|) (not .cse0) (not .cse1)) (and (= ~b$r_buff0_thd3~0_In-165302755 |P2Thread1of1ForFork1_#t~ite42_Out-165302755|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-165302755, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-165302755} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-165302755, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-165302755, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-165302755|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 02:17:52,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In551122307 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In551122307 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In551122307 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd3~0_In551122307 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out551122307| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite43_Out551122307| ~b$r_buff1_thd3~0_In551122307) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In551122307, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In551122307, ~b$w_buff1_used~0=~b$w_buff1_used~0_In551122307, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In551122307} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In551122307, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In551122307, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out551122307|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In551122307, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In551122307} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 02:17:52,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 02:17:52,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In573409183 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In573409183 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out573409183| ~b$w_buff0_used~0_In573409183) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out573409183| 0) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In573409183, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In573409183} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In573409183, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In573409183, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out573409183|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:17:52,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-998174593 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-998174593 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd1~0_In-998174593 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-998174593 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite6_Out-998174593| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite6_Out-998174593| ~b$w_buff1_used~0_In-998174593)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-998174593, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-998174593, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-998174593, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-998174593} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-998174593, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-998174593, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-998174593, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-998174593, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-998174593|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:17:52,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In2142427580 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd1~0_In2142427580 256) 0))) (or (and (= ~b$r_buff0_thd1~0_Out2142427580 ~b$r_buff0_thd1~0_In2142427580) (or .cse0 .cse1)) (and (not .cse0) (= ~b$r_buff0_thd1~0_Out2142427580 0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2142427580, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2142427580} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2142427580, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out2142427580, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out2142427580|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:17:52,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1854130197 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd1~0_In1854130197 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In1854130197 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In1854130197 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite8_Out1854130197| ~b$r_buff1_thd1~0_In1854130197) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out1854130197|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1854130197, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1854130197, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1854130197, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1854130197} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1854130197, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1854130197, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1854130197, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1854130197, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1854130197|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:17:52,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:17:52,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:17:52,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In189467026 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In189467026 256) 0))) (or (and (= ~b~0_In189467026 |ULTIMATE.start_main_#t~ite47_Out189467026|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out189467026| ~b$w_buff1~0_In189467026) (not .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In189467026, ~b$w_buff1_used~0=~b$w_buff1_used~0_In189467026, ~b~0=~b~0_In189467026, ~b$w_buff1~0=~b$w_buff1~0_In189467026} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In189467026, ~b$w_buff1_used~0=~b$w_buff1_used~0_In189467026, ~b~0=~b~0_In189467026, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out189467026|, ~b$w_buff1~0=~b$w_buff1~0_In189467026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 02:17:52,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:17:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-2122517662 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd0~0_In-2122517662 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-2122517662| ~b$w_buff0_used~0_In-2122517662) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-2122517662| 0) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2122517662, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2122517662} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2122517662, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2122517662|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2122517662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:17:52,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In945078002 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In945078002 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In945078002 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In945078002 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out945078002|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In945078002 |ULTIMATE.start_main_#t~ite50_Out945078002|) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In945078002, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In945078002, ~b$w_buff1_used~0=~b$w_buff1_used~0_In945078002, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In945078002} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out945078002|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In945078002, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In945078002, ~b$w_buff1_used~0=~b$w_buff1_used~0_In945078002, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In945078002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:17:52,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In221191332 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In221191332 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out221191332| ~b$r_buff0_thd0~0_In221191332) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out221191332| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In221191332, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In221191332} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In221191332, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out221191332|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In221191332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:17:52,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd0~0_In1001288217 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In1001288217 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd0~0_In1001288217 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In1001288217 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In1001288217 |ULTIMATE.start_main_#t~ite52_Out1001288217|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1001288217|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1001288217, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1001288217, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1001288217, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1001288217} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1001288217, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1001288217|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1001288217, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1001288217, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1001288217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:17:52,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:17:52,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:17:52 BasicIcfg [2019-12-27 02:17:52,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:17:52,153 INFO L168 Benchmark]: Toolchain (without parser) took 111104.88 ms. Allocated memory was 137.9 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,153 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.27 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.7 MB in the beginning and 156.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.08 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,156 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,156 INFO L168 Benchmark]: RCFGBuilder took 867.76 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 100.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,156 INFO L168 Benchmark]: TraceAbstraction took 109270.41 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:17:52,158 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.27 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.7 MB in the beginning and 156.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.08 ms. Allocated memory is still 203.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.76 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 100.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109270.41 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.9s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7508 SDtfs, 12308 SDslu, 27791 SDs, 0 SdLazy, 15260 SolverSat, 537 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 192174 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1771 NumberOfCodeBlocks, 1771 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 408636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...