/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:30:59,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:30:59,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:30:59,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:30:59,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:30:59,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:30:59,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:30:59,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:30:59,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:30:59,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:30:59,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:30:59,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:30:59,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:30:59,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:30:59,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:30:59,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:30:59,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:30:59,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:30:59,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:30:59,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:30:59,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:30:59,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:30:59,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:30:59,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:30:59,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:30:59,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:30:59,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:30:59,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:30:59,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:30:59,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:30:59,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:30:59,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:30:59,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:30:59,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:30:59,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:30:59,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:30:59,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:30:59,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:30:59,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:30:59,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:30:59,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:30:59,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:30:59,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:30:59,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:30:59,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:30:59,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:30:59,897 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:30:59,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:30:59,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:30:59,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:30:59,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:30:59,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:30:59,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:30:59,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:30:59,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:30:59,899 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:30:59,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:30:59,900 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:30:59,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:30:59,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:30:59,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:30:59,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:30:59,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:30:59,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:30:59,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:30:59,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:30:59,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:30:59,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:30:59,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:30:59,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:30:59,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:30:59,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:31:00,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:31:00,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:31:00,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:31:00,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:31:00,212 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:31:00,213 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2019-12-18 14:31:00,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7974c9/35ef65fe89354a3aa1ed7c73e22ff54b/FLAG28e26c9f4 [2019-12-18 14:31:00,843 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:31:00,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2019-12-18 14:31:00,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7974c9/35ef65fe89354a3aa1ed7c73e22ff54b/FLAG28e26c9f4 [2019-12-18 14:31:01,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7974c9/35ef65fe89354a3aa1ed7c73e22ff54b [2019-12-18 14:31:01,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:31:01,184 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:31:01,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:31:01,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:31:01,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:31:01,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:01,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3265302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01, skipping insertion in model container [2019-12-18 14:31:01,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:01,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:31:01,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:31:01,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:31:01,761 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:31:01,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:31:01,956 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:31:01,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01 WrapperNode [2019-12-18 14:31:01,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:31:01,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:31:01,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:31:01,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:31:01,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:01,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:31:02,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:31:02,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:31:02,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:31:02,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (1/1) ... [2019-12-18 14:31:02,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:31:02,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:31:02,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:31:02,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:31:02,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31: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-18 14:31:02,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:31:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:31:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:31:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:31:02,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:31:02,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:31:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:31:02,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:31:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:31:02,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:31:02,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:31:02,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:31:02,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:31:02,148 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:31:02,963 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:31:02,964 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:31:02,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:31:02 BoogieIcfgContainer [2019-12-18 14:31:02,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:31:02,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:31:02,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:31:02,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:31:02,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:31:01" (1/3) ... [2019-12-18 14:31:02,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16170a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:31:02, skipping insertion in model container [2019-12-18 14:31:02,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:01" (2/3) ... [2019-12-18 14:31:02,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16170a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:31:02, skipping insertion in model container [2019-12-18 14:31:02,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:31:02" (3/3) ... [2019-12-18 14:31:02,975 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2019-12-18 14:31:02,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:31:02,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:31:02,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:31:02,997 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:31:03,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,112 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,112 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,132 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,133 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:03,151 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:31:03,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:31:03,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:31:03,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:31:03,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:31:03,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:31:03,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:31:03,176 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:31:03,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:31:03,196 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:31:03,197 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:31:03,283 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:31:03,283 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:31:03,300 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:31:03,326 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:31:03,396 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:31:03,396 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:31:03,408 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:31:03,436 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:31:03,437 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:31:09,117 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:31:09,225 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:31:09,340 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-18 14:31:09,343 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 14:31:09,347 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:31:20,439 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 14:31:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 14:31:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:31:20,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:20,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:31:20,450 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-18 14:31:20,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:20,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851046244] [2019-12-18 14:31:20,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:20,701 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-18 14:31:20,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851046244] [2019-12-18 14:31:20,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:20,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:31:20,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228966046] [2019-12-18 14:31:20,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:31:20,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:31:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:31:20,722 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 14:31:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:24,020 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 14:31:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:31:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:31:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:24,595 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 14:31:24,596 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 14:31:24,597 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-18 14:31:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 14:31:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 14:31:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 14:31:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 14:31:31,831 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 14:31:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:31:31,831 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 14:31:31,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:31:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 14:31:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:31:31,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:31,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:31:31,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-18 14:31:31,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:31,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127978182] [2019-12-18 14:31:31,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:31,974 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-18 14:31:31,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127978182] [2019-12-18 14:31:31,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:31,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:31:31,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956236109] [2019-12-18 14:31:31,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:31:31,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:31:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:31:31,978 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 14:31:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:36,436 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 14:31:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:31:36,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:31:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:36,852 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 14:31:36,852 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 14:31:36,853 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-18 14:31:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 14:31:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 14:31:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 14:31:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 14:31:43,991 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 14:31:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:31:43,992 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 14:31:43,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:31:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 14:31:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:31:43,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:31:43,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:31:43,996 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:31:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:31:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-18 14:31:43,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:31:43,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338814192] [2019-12-18 14:31:43,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:31:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:31:44,086 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-18 14:31:44,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338814192] [2019-12-18 14:31:44,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:31:44,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:31:44,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110074836] [2019-12-18 14:31:44,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:31:44,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:31:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:31:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:31:44,089 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 14:31:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:31:49,304 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-18 14:31:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:31:49,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:31:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:31:50,086 INFO L225 Difference]: With dead ends: 159677 [2019-12-18 14:31:50,086 INFO L226 Difference]: Without dead ends: 159565 [2019-12-18 14:31:50,086 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-18 14:31:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-18 14:32:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-18 14:32:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-18 14:32:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-18 14:32:01,520 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-18 14:32:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:01,521 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-18 14:32:01,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-18 14:32:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:01,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:01,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:01,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-18 14:32:01,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:01,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844296647] [2019-12-18 14:32:01,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:01,597 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-18 14:32:01,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844296647] [2019-12-18 14:32:01,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:01,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:01,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038836143] [2019-12-18 14:32:01,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:01,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:01,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:01,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:01,599 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-18 14:32:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:03,583 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-18 14:32:03,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:03,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:32:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:04,160 INFO L225 Difference]: With dead ends: 181618 [2019-12-18 14:32:04,160 INFO L226 Difference]: Without dead ends: 181618 [2019-12-18 14:32:04,161 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-18 14:32:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-18 14:32:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-18 14:32:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-18 14:32:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-18 14:32:17,369 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-18 14:32:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:17,369 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-18 14:32:17,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-18 14:32:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:17,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:17,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:17,373 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-18 14:32:17,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:17,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262180263] [2019-12-18 14:32:17,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:17,444 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-18 14:32:17,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262180263] [2019-12-18 14:32:17,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:17,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:17,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734515849] [2019-12-18 14:32:17,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:17,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:17,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:17,452 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-18 14:32:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:19,899 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-18 14:32:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:19,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:32:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:20,445 INFO L225 Difference]: With dead ends: 179622 [2019-12-18 14:32:20,446 INFO L226 Difference]: Without dead ends: 179542 [2019-12-18 14:32:20,446 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-18 14:32:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-18 14:32:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-18 14:32:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-18 14:32:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-18 14:32:34,179 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-18 14:32:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:34,180 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-18 14:32:34,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-18 14:32:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:34,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:34,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:34,183 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:34,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-18 14:32:34,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:34,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849312395] [2019-12-18 14:32:34,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:34,237 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-18 14:32:34,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849312395] [2019-12-18 14:32:34,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:34,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:34,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381416633] [2019-12-18 14:32:34,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:34,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:34,240 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-18 14:32:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:36,480 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-18 14:32:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:36,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:32:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:37,039 INFO L225 Difference]: With dead ends: 189091 [2019-12-18 14:32:37,039 INFO L226 Difference]: Without dead ends: 188995 [2019-12-18 14:32:37,039 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-18 14:32:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-18 14:32:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-18 14:32:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-18 14:32:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-18 14:32:53,202 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-18 14:32:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:53,202 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-18 14:32:53,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-18 14:32:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:32:53,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:53,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:53,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-18 14:32:53,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:53,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165802953] [2019-12-18 14:32:53,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:53,272 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-18 14:32:53,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165802953] [2019-12-18 14:32:53,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:53,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:32:53,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755927898] [2019-12-18 14:32:53,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:53,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:53,275 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-18 14:32:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:55,261 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-18 14:32:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:55,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:32:55,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:55,762 INFO L225 Difference]: With dead ends: 160940 [2019-12-18 14:32:55,762 INFO L226 Difference]: Without dead ends: 160940 [2019-12-18 14:32:55,763 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-18 14:33:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-18 14:33:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-18 14:33:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-18 14:33:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-18 14:33:09,600 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-18 14:33:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:09,600 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-18 14:33:09,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-18 14:33:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:33:09,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:09,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:09,622 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-18 14:33:09,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:09,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734514076] [2019-12-18 14:33:09,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:09,682 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-18 14:33:09,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734514076] [2019-12-18 14:33:09,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:09,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:09,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219962546] [2019-12-18 14:33:09,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:33:09,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:33:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:33:09,684 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-18 14:33:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:18,102 INFO L93 Difference]: Finished difference Result 297697 states and 1230452 transitions. [2019-12-18 14:33:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:33:18,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:33:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:18,637 INFO L225 Difference]: With dead ends: 297697 [2019-12-18 14:33:18,637 INFO L226 Difference]: Without dead ends: 170729 [2019-12-18 14:33:18,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170729 states. [2019-12-18 14:33:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170729 to 169732. [2019-12-18 14:33:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169732 states. [2019-12-18 14:33:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169732 states to 169732 states and 694021 transitions. [2019-12-18 14:33:27,194 INFO L78 Accepts]: Start accepts. Automaton has 169732 states and 694021 transitions. Word has length 19 [2019-12-18 14:33:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:27,194 INFO L462 AbstractCegarLoop]: Abstraction has 169732 states and 694021 transitions. [2019-12-18 14:33:27,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:33:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 169732 states and 694021 transitions. [2019-12-18 14:33:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:33:27,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:27,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:33:27,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-18 14:33:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:27,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207352553] [2019-12-18 14:33:27,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:27,300 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-18 14:33:27,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207352553] [2019-12-18 14:33:27,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:27,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:27,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204585966] [2019-12-18 14:33:27,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:33:27,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:33:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:33:27,303 INFO L87 Difference]: Start difference. First operand 169732 states and 694021 transitions. Second operand 4 states. [2019-12-18 14:33:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:27,529 INFO L93 Difference]: Finished difference Result 49048 states and 168395 transitions. [2019-12-18 14:33:27,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:33:27,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:33:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:27,604 INFO L225 Difference]: With dead ends: 49048 [2019-12-18 14:33:27,604 INFO L226 Difference]: Without dead ends: 38053 [2019-12-18 14:33:27,604 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-18 14:33:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38053 states. [2019-12-18 14:33:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38053 to 37601. [2019-12-18 14:33:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37601 states. [2019-12-18 14:33:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37601 states to 37601 states and 124116 transitions. [2019-12-18 14:33:28,274 INFO L78 Accepts]: Start accepts. Automaton has 37601 states and 124116 transitions. Word has length 19 [2019-12-18 14:33:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:28,274 INFO L462 AbstractCegarLoop]: Abstraction has 37601 states and 124116 transitions. [2019-12-18 14:33:28,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:33:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37601 states and 124116 transitions. [2019-12-18 14:33:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:33:28,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:28,281 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-18 14:33:28,281 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:28,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-18 14:33:28,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:28,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177576064] [2019-12-18 14:33:28,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:28,369 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-18 14:33:28,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177576064] [2019-12-18 14:33:28,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:28,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:28,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493747647] [2019-12-18 14:33:28,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:28,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:28,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:28,371 INFO L87 Difference]: Start difference. First operand 37601 states and 124116 transitions. Second operand 5 states. [2019-12-18 14:33:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:30,894 INFO L93 Difference]: Finished difference Result 50439 states and 163679 transitions. [2019-12-18 14:33:30,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:33:30,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:33:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:30,990 INFO L225 Difference]: With dead ends: 50439 [2019-12-18 14:33:30,990 INFO L226 Difference]: Without dead ends: 50137 [2019-12-18 14:33:30,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50137 states. [2019-12-18 14:33:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50137 to 38325. [2019-12-18 14:33:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38325 states. [2019-12-18 14:33:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38325 states to 38325 states and 126442 transitions. [2019-12-18 14:33:31,756 INFO L78 Accepts]: Start accepts. Automaton has 38325 states and 126442 transitions. Word has length 22 [2019-12-18 14:33:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:31,757 INFO L462 AbstractCegarLoop]: Abstraction has 38325 states and 126442 transitions. [2019-12-18 14:33:31,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38325 states and 126442 transitions. [2019-12-18 14:33:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:33:31,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:31,764 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-18 14:33:31,764 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-18 14:33:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:31,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142201307] [2019-12-18 14:33:31,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:31,841 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-18 14:33:31,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142201307] [2019-12-18 14:33:31,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:31,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:31,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741600980] [2019-12-18 14:33:31,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:31,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:31,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:31,844 INFO L87 Difference]: Start difference. First operand 38325 states and 126442 transitions. Second operand 5 states. [2019-12-18 14:33:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:32,481 INFO L93 Difference]: Finished difference Result 50758 states and 164508 transitions. [2019-12-18 14:33:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:33:32,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:33:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:32,974 INFO L225 Difference]: With dead ends: 50758 [2019-12-18 14:33:32,974 INFO L226 Difference]: Without dead ends: 50338 [2019-12-18 14:33:32,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50338 states. [2019-12-18 14:33:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50338 to 35870. [2019-12-18 14:33:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35870 states. [2019-12-18 14:33:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35870 states to 35870 states and 118280 transitions. [2019-12-18 14:33:33,675 INFO L78 Accepts]: Start accepts. Automaton has 35870 states and 118280 transitions. Word has length 22 [2019-12-18 14:33:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 35870 states and 118280 transitions. [2019-12-18 14:33:33,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35870 states and 118280 transitions. [2019-12-18 14:33:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:33:33,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:33,687 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-18 14:33:33,687 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-18 14:33:33,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:33,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839441075] [2019-12-18 14:33:33,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:33,790 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-18 14:33:33,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839441075] [2019-12-18 14:33:33,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:33,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:33,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955576061] [2019-12-18 14:33:33,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:33,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:33,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:33,792 INFO L87 Difference]: Start difference. First operand 35870 states and 118280 transitions. Second operand 5 states. [2019-12-18 14:33:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:34,302 INFO L93 Difference]: Finished difference Result 49184 states and 158828 transitions. [2019-12-18 14:33:34,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:33:34,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:33:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:34,387 INFO L225 Difference]: With dead ends: 49184 [2019-12-18 14:33:34,388 INFO L226 Difference]: Without dead ends: 48744 [2019-12-18 14:33:34,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48744 states. [2019-12-18 14:33:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48744 to 39958. [2019-12-18 14:33:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-18 14:33:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 131043 transitions. [2019-12-18 14:33:35,483 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 131043 transitions. Word has length 25 [2019-12-18 14:33:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:35,483 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 131043 transitions. [2019-12-18 14:33:35,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 131043 transitions. [2019-12-18 14:33:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:33:35,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:35,502 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] [2019-12-18 14:33:35,502 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-18 14:33:35,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:35,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881974697] [2019-12-18 14:33:35,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:35,572 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-18 14:33:35,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881974697] [2019-12-18 14:33:35,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:35,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:35,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996576495] [2019-12-18 14:33:35,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:35,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:35,574 INFO L87 Difference]: Start difference. First operand 39958 states and 131043 transitions. Second operand 5 states. [2019-12-18 14:33:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:35,983 INFO L93 Difference]: Finished difference Result 50424 states and 163757 transitions. [2019-12-18 14:33:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:33:35,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:33:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:36,076 INFO L225 Difference]: With dead ends: 50424 [2019-12-18 14:33:36,076 INFO L226 Difference]: Without dead ends: 50050 [2019-12-18 14:33:36,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50050 states. [2019-12-18 14:33:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50050 to 41737. [2019-12-18 14:33:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41737 states. [2019-12-18 14:33:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41737 states to 41737 states and 136855 transitions. [2019-12-18 14:33:37,195 INFO L78 Accepts]: Start accepts. Automaton has 41737 states and 136855 transitions. Word has length 28 [2019-12-18 14:33:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:37,196 INFO L462 AbstractCegarLoop]: Abstraction has 41737 states and 136855 transitions. [2019-12-18 14:33:37,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41737 states and 136855 transitions. [2019-12-18 14:33:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:33:37,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:37,218 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] [2019-12-18 14:33:37,218 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-18 14:33:37,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:37,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059122987] [2019-12-18 14:33:37,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:37,263 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-18 14:33:37,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059122987] [2019-12-18 14:33:37,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:37,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:37,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751911840] [2019-12-18 14:33:37,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:37,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:37,266 INFO L87 Difference]: Start difference. First operand 41737 states and 136855 transitions. Second operand 3 states. [2019-12-18 14:33:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:37,599 INFO L93 Difference]: Finished difference Result 52983 states and 172445 transitions. [2019-12-18 14:33:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:37,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 14:33:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:37,743 INFO L225 Difference]: With dead ends: 52983 [2019-12-18 14:33:37,743 INFO L226 Difference]: Without dead ends: 52983 [2019-12-18 14:33:37,745 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-18 14:33:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52983 states. [2019-12-18 14:33:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52983 to 43481. [2019-12-18 14:33:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43481 states. [2019-12-18 14:33:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43481 states to 43481 states and 140263 transitions. [2019-12-18 14:33:38,615 INFO L78 Accepts]: Start accepts. Automaton has 43481 states and 140263 transitions. Word has length 28 [2019-12-18 14:33:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:38,616 INFO L462 AbstractCegarLoop]: Abstraction has 43481 states and 140263 transitions. [2019-12-18 14:33:38,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 43481 states and 140263 transitions. [2019-12-18 14:33:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:33:38,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:38,635 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] [2019-12-18 14:33:38,635 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-18 14:33:38,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:38,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155329149] [2019-12-18 14:33:38,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:38,727 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-18 14:33:38,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155329149] [2019-12-18 14:33:38,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:38,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:38,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502410738] [2019-12-18 14:33:38,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:38,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:38,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:38,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:38,729 INFO L87 Difference]: Start difference. First operand 43481 states and 140263 transitions. Second operand 5 states. [2019-12-18 14:33:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:39,376 INFO L93 Difference]: Finished difference Result 54179 states and 173086 transitions. [2019-12-18 14:33:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:33:39,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 14:33:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:39,472 INFO L225 Difference]: With dead ends: 54179 [2019-12-18 14:33:39,472 INFO L226 Difference]: Without dead ends: 53785 [2019-12-18 14:33:39,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53785 states. [2019-12-18 14:33:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53785 to 42787. [2019-12-18 14:33:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42787 states. [2019-12-18 14:33:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42787 states to 42787 states and 137824 transitions. [2019-12-18 14:33:40,263 INFO L78 Accepts]: Start accepts. Automaton has 42787 states and 137824 transitions. Word has length 29 [2019-12-18 14:33:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:40,263 INFO L462 AbstractCegarLoop]: Abstraction has 42787 states and 137824 transitions. [2019-12-18 14:33:40,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 42787 states and 137824 transitions. [2019-12-18 14:33:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 14:33:40,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:40,281 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] [2019-12-18 14:33:40,281 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-18 14:33:40,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:40,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894549399] [2019-12-18 14:33:40,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:40,325 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-18 14:33:40,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894549399] [2019-12-18 14:33:40,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:40,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:40,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661711816] [2019-12-18 14:33:40,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:40,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:40,327 INFO L87 Difference]: Start difference. First operand 42787 states and 137824 transitions. Second operand 3 states. [2019-12-18 14:33:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:40,531 INFO L93 Difference]: Finished difference Result 62369 states and 203785 transitions. [2019-12-18 14:33:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:40,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 14:33:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:40,579 INFO L225 Difference]: With dead ends: 62369 [2019-12-18 14:33:40,580 INFO L226 Difference]: Without dead ends: 27708 [2019-12-18 14:33:40,580 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-18 14:33:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27708 states. [2019-12-18 14:33:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27708 to 26920. [2019-12-18 14:33:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26920 states. [2019-12-18 14:33:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26920 states to 26920 states and 86266 transitions. [2019-12-18 14:33:41,352 INFO L78 Accepts]: Start accepts. Automaton has 26920 states and 86266 transitions. Word has length 29 [2019-12-18 14:33:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:41,352 INFO L462 AbstractCegarLoop]: Abstraction has 26920 states and 86266 transitions. [2019-12-18 14:33:41,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 26920 states and 86266 transitions. [2019-12-18 14:33:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:33:41,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:41,365 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] [2019-12-18 14:33:41,365 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:41,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:41,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-18 14:33:41,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:41,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956876367] [2019-12-18 14:33:41,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:41,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-18 14:33:41,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956876367] [2019-12-18 14:33:41,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:41,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:33:41,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805936411] [2019-12-18 14:33:41,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:33:41,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:33:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:33:41,418 INFO L87 Difference]: Start difference. First operand 26920 states and 86266 transitions. Second operand 4 states. [2019-12-18 14:33:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:41,641 INFO L93 Difference]: Finished difference Result 44120 states and 145060 transitions. [2019-12-18 14:33:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:33:41,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-18 14:33:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:41,690 INFO L225 Difference]: With dead ends: 44120 [2019-12-18 14:33:41,690 INFO L226 Difference]: Without dead ends: 21429 [2019-12-18 14:33:41,691 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-18 14:33:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-18 14:33:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-18 14:33:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-18 14:33:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-18 14:33:42,078 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 30 [2019-12-18 14:33:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:42,079 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-18 14:33:42,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:33:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-18 14:33:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:33:42,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:42,089 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] [2019-12-18 14:33:42,090 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-18 14:33:42,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:42,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985596991] [2019-12-18 14:33:42,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:42,153 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-18 14:33:42,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985596991] [2019-12-18 14:33:42,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:42,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:33:42,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535842599] [2019-12-18 14:33:42,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:42,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:42,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:42,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:42,155 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-18 14:33:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:42,816 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-18 14:33:42,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:42,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 14:33:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:42,904 INFO L225 Difference]: With dead ends: 34767 [2019-12-18 14:33:42,904 INFO L226 Difference]: Without dead ends: 34767 [2019-12-18 14:33:42,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-18 14:33:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-18 14:33:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-18 14:33:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-18 14:33:43,715 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-18 14:33:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:43,716 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-18 14:33:43,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-18 14:33:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:33:43,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:43,736 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] [2019-12-18 14:33:43,736 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-18 14:33:43,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:43,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522920994] [2019-12-18 14:33:43,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:43,801 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-18 14:33:43,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522920994] [2019-12-18 14:33:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:33:43,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966312382] [2019-12-18 14:33:43,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:33:43,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:33:43,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:33:43,803 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-18 14:33:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:43,908 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-18 14:33:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:33:43,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 14:33:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:43,929 INFO L225 Difference]: With dead ends: 13178 [2019-12-18 14:33:43,929 INFO L226 Difference]: Without dead ends: 11110 [2019-12-18 14:33:43,929 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-18 14:33:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-18 14:33:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-18 14:33:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-18 14:33:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-18 14:33:44,173 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-18 14:33:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:44,173 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-18 14:33:44,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:33:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-18 14:33:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:44,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:44,192 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-18 14:33:44,192 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-18 14:33:44,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:44,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758164312] [2019-12-18 14:33:44,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:44,272 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-18 14:33:44,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758164312] [2019-12-18 14:33:44,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:44,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:33:44,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579185493] [2019-12-18 14:33:44,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:44,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:44,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:44,275 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-18 14:33:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:44,572 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-18 14:33:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:44,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:33:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:44,599 INFO L225 Difference]: With dead ends: 11069 [2019-12-18 14:33:44,599 INFO L226 Difference]: Without dead ends: 10842 [2019-12-18 14:33:44,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-18 14:33:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-18 14:33:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-18 14:33:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-18 14:33:44,861 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-18 14:33:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:44,861 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-18 14:33:44,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-18 14:33:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:44,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:44,876 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-18 14:33:44,877 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-18 14:33:44,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:44,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838452340] [2019-12-18 14:33:44,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:44,956 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-18 14:33:44,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838452340] [2019-12-18 14:33:44,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:44,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:33:44,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281326117] [2019-12-18 14:33:44,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:44,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:44,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:44,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:44,958 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-18 14:33:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:45,742 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-18 14:33:45,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:33:45,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 14:33:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:45,771 INFO L225 Difference]: With dead ends: 20964 [2019-12-18 14:33:45,771 INFO L226 Difference]: Without dead ends: 20964 [2019-12-18 14:33:45,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-18 14:33:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-18 14:33:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-18 14:33:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-18 14:33:46,021 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-18 14:33:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:46,021 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-18 14:33:46,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-18 14:33:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:46,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:46,036 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-18 14:33:46,036 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-18 14:33:46,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:46,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621733542] [2019-12-18 14:33:46,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:46,136 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-18 14:33:46,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621733542] [2019-12-18 14:33:46,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:46,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:33:46,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229301335] [2019-12-18 14:33:46,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:33:46,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:33:46,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:46,138 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 7 states. [2019-12-18 14:33:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:47,117 INFO L93 Difference]: Finished difference Result 23178 states and 68867 transitions. [2019-12-18 14:33:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:33:47,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 14:33:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:47,148 INFO L225 Difference]: With dead ends: 23178 [2019-12-18 14:33:47,148 INFO L226 Difference]: Without dead ends: 23178 [2019-12-18 14:33:47,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:33:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23178 states. [2019-12-18 14:33:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23178 to 13796. [2019-12-18 14:33:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-12-18 14:33:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 41573 transitions. [2019-12-18 14:33:47,496 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 41573 transitions. Word has length 40 [2019-12-18 14:33:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:47,496 INFO L462 AbstractCegarLoop]: Abstraction has 13796 states and 41573 transitions. [2019-12-18 14:33:47,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:33:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 41573 transitions. [2019-12-18 14:33:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:33:47,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:47,509 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-18 14:33:47,509 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 3 times [2019-12-18 14:33:47,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:47,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252159976] [2019-12-18 14:33:47,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:47,616 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-18 14:33:47,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252159976] [2019-12-18 14:33:47,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:47,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:33:47,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3568448] [2019-12-18 14:33:47,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:33:47,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:47,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:33:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:33:47,618 INFO L87 Difference]: Start difference. First operand 13796 states and 41573 transitions. Second operand 7 states. [2019-12-18 14:33:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:48,501 INFO L93 Difference]: Finished difference Result 18988 states and 55814 transitions. [2019-12-18 14:33:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:33:48,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 14:33:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:48,547 INFO L225 Difference]: With dead ends: 18988 [2019-12-18 14:33:48,547 INFO L226 Difference]: Without dead ends: 18988 [2019-12-18 14:33:48,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:33:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2019-12-18 14:33:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 13856. [2019-12-18 14:33:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13856 states. [2019-12-18 14:33:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 41743 transitions. [2019-12-18 14:33:48,964 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 41743 transitions. Word has length 40 [2019-12-18 14:33:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:48,964 INFO L462 AbstractCegarLoop]: Abstraction has 13856 states and 41743 transitions. [2019-12-18 14:33:48,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:33:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 41743 transitions. [2019-12-18 14:33:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:33:48,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:48,987 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] [2019-12-18 14:33:48,988 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-18 14:33:48,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:48,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715071497] [2019-12-18 14:33:48,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:49,106 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-18 14:33:49,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715071497] [2019-12-18 14:33:49,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:49,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:33:49,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049938775] [2019-12-18 14:33:49,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:49,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:49,110 INFO L87 Difference]: Start difference. First operand 13856 states and 41743 transitions. Second operand 6 states. [2019-12-18 14:33:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:49,341 INFO L93 Difference]: Finished difference Result 13842 states and 41710 transitions. [2019-12-18 14:33:49,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:49,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:33:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:49,362 INFO L225 Difference]: With dead ends: 13842 [2019-12-18 14:33:49,362 INFO L226 Difference]: Without dead ends: 13501 [2019-12-18 14:33:49,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13501 states. [2019-12-18 14:33:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13501 to 13501. [2019-12-18 14:33:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13501 states. [2019-12-18 14:33:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13501 states to 13501 states and 41055 transitions. [2019-12-18 14:33:49,562 INFO L78 Accepts]: Start accepts. Automaton has 13501 states and 41055 transitions. Word has length 41 [2019-12-18 14:33:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:49,562 INFO L462 AbstractCegarLoop]: Abstraction has 13501 states and 41055 transitions. [2019-12-18 14:33:49,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 13501 states and 41055 transitions. [2019-12-18 14:33:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:33:49,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:49,577 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] [2019-12-18 14:33:49,577 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-18 14:33:49,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:49,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135445152] [2019-12-18 14:33:49,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:49,630 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-18 14:33:49,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135445152] [2019-12-18 14:33:49,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:49,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:49,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860312275] [2019-12-18 14:33:49,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:49,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:49,632 INFO L87 Difference]: Start difference. First operand 13501 states and 41055 transitions. Second operand 3 states. [2019-12-18 14:33:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:49,681 INFO L93 Difference]: Finished difference Result 10187 states and 30316 transitions. [2019-12-18 14:33:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:49,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:33:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:49,699 INFO L225 Difference]: With dead ends: 10187 [2019-12-18 14:33:49,699 INFO L226 Difference]: Without dead ends: 10187 [2019-12-18 14:33:49,699 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-18 14:33:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10187 states. [2019-12-18 14:33:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10187 to 10179. [2019-12-18 14:33:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10179 states. [2019-12-18 14:33:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 30296 transitions. [2019-12-18 14:33:49,965 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 30296 transitions. Word has length 41 [2019-12-18 14:33:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:49,966 INFO L462 AbstractCegarLoop]: Abstraction has 10179 states and 30296 transitions. [2019-12-18 14:33:49,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 30296 transitions. [2019-12-18 14:33:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:33:49,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:49,985 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] [2019-12-18 14:33:49,985 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1212552046, now seen corresponding path program 1 times [2019-12-18 14:33:49,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:49,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356129086] [2019-12-18 14:33:49,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:50,045 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-18 14:33:50,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356129086] [2019-12-18 14:33:50,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:50,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:33:50,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586859205] [2019-12-18 14:33:50,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:33:50,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:33:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:33:50,048 INFO L87 Difference]: Start difference. First operand 10179 states and 30296 transitions. Second operand 3 states. [2019-12-18 14:33:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:50,112 INFO L93 Difference]: Finished difference Result 10101 states and 30022 transitions. [2019-12-18 14:33:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:33:50,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:33:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:50,136 INFO L225 Difference]: With dead ends: 10101 [2019-12-18 14:33:50,137 INFO L226 Difference]: Without dead ends: 10101 [2019-12-18 14:33:50,137 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-18 14:33:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10101 states. [2019-12-18 14:33:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10101 to 8436. [2019-12-18 14:33:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-18 14:33:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 25325 transitions. [2019-12-18 14:33:50,338 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 25325 transitions. Word has length 41 [2019-12-18 14:33:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:50,338 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 25325 transitions. [2019-12-18 14:33:50,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:33:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 25325 transitions. [2019-12-18 14:33:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:33:50,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:50,350 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] [2019-12-18 14:33:50,351 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1119333898, now seen corresponding path program 1 times [2019-12-18 14:33:50,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:50,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897817596] [2019-12-18 14:33:50,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:50,425 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-18 14:33:50,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897817596] [2019-12-18 14:33:50,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:50,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:33:50,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621826189] [2019-12-18 14:33:50,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:33:50,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:33:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:33:50,426 INFO L87 Difference]: Start difference. First operand 8436 states and 25325 transitions. Second operand 6 states. [2019-12-18 14:33:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:50,524 INFO L93 Difference]: Finished difference Result 7519 states and 23100 transitions. [2019-12-18 14:33:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:33:50,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 14:33:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:50,537 INFO L225 Difference]: With dead ends: 7519 [2019-12-18 14:33:50,538 INFO L226 Difference]: Without dead ends: 7420 [2019-12-18 14:33:50,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2019-12-18 14:33:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 7348. [2019-12-18 14:33:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7348 states. [2019-12-18 14:33:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 22673 transitions. [2019-12-18 14:33:50,708 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 22673 transitions. Word has length 42 [2019-12-18 14:33:50,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:50,709 INFO L462 AbstractCegarLoop]: Abstraction has 7348 states and 22673 transitions. [2019-12-18 14:33:50,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:33:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 22673 transitions. [2019-12-18 14:33:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:50,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:50,797 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] [2019-12-18 14:33:50,798 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 1 times [2019-12-18 14:33:50,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:50,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630704285] [2019-12-18 14:33:50,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:50,913 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-18 14:33:50,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630704285] [2019-12-18 14:33:50,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:50,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:33:50,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424845348] [2019-12-18 14:33:50,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:33:50,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:33:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:33:50,915 INFO L87 Difference]: Start difference. First operand 7348 states and 22673 transitions. Second operand 9 states. [2019-12-18 14:33:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:52,010 INFO L93 Difference]: Finished difference Result 14260 states and 43118 transitions. [2019-12-18 14:33:52,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:33:52,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 14:33:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:52,025 INFO L225 Difference]: With dead ends: 14260 [2019-12-18 14:33:52,026 INFO L226 Difference]: Without dead ends: 9369 [2019-12-18 14:33:52,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:33:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2019-12-18 14:33:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 8779. [2019-12-18 14:33:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8779 states. [2019-12-18 14:33:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8779 states to 8779 states and 26457 transitions. [2019-12-18 14:33:52,160 INFO L78 Accepts]: Start accepts. Automaton has 8779 states and 26457 transitions. Word has length 56 [2019-12-18 14:33:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:52,160 INFO L462 AbstractCegarLoop]: Abstraction has 8779 states and 26457 transitions. [2019-12-18 14:33:52,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:33:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8779 states and 26457 transitions. [2019-12-18 14:33:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:52,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:52,169 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] [2019-12-18 14:33:52,169 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 425157206, now seen corresponding path program 2 times [2019-12-18 14:33:52,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:52,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952714354] [2019-12-18 14:33:52,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:52,346 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-18 14:33:52,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952714354] [2019-12-18 14:33:52,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:33:52,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116480216] [2019-12-18 14:33:52,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:33:52,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:33:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:33:52,347 INFO L87 Difference]: Start difference. First operand 8779 states and 26457 transitions. Second operand 11 states. [2019-12-18 14:33:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:53,194 INFO L93 Difference]: Finished difference Result 13415 states and 40306 transitions. [2019-12-18 14:33:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:33:53,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:33:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:53,214 INFO L225 Difference]: With dead ends: 13415 [2019-12-18 14:33:53,215 INFO L226 Difference]: Without dead ends: 12721 [2019-12-18 14:33:53,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:33:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12721 states. [2019-12-18 14:33:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12721 to 11749. [2019-12-18 14:33:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11749 states. [2019-12-18 14:33:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11749 states to 11749 states and 35383 transitions. [2019-12-18 14:33:53,404 INFO L78 Accepts]: Start accepts. Automaton has 11749 states and 35383 transitions. Word has length 56 [2019-12-18 14:33:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:53,405 INFO L462 AbstractCegarLoop]: Abstraction has 11749 states and 35383 transitions. [2019-12-18 14:33:53,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:33:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11749 states and 35383 transitions. [2019-12-18 14:33:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:53,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:53,417 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] [2019-12-18 14:33:53,417 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2122420018, now seen corresponding path program 3 times [2019-12-18 14:33:53,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:53,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324543825] [2019-12-18 14:33:53,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:53,563 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-18 14:33:53,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324543825] [2019-12-18 14:33:53,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:53,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:33:53,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527875854] [2019-12-18 14:33:53,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:33:53,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:53,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:33:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:33:53,565 INFO L87 Difference]: Start difference. First operand 11749 states and 35383 transitions. Second operand 11 states. [2019-12-18 14:33:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:54,317 INFO L93 Difference]: Finished difference Result 12939 states and 38386 transitions. [2019-12-18 14:33:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:33:54,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:33:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:54,332 INFO L225 Difference]: With dead ends: 12939 [2019-12-18 14:33:54,332 INFO L226 Difference]: Without dead ends: 9560 [2019-12-18 14:33:54,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:33:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9560 states. [2019-12-18 14:33:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9560 to 8674. [2019-12-18 14:33:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 14:33:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 25965 transitions. [2019-12-18 14:33:54,467 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 25965 transitions. Word has length 56 [2019-12-18 14:33:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:54,467 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 25965 transitions. [2019-12-18 14:33:54,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:33:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 25965 transitions. [2019-12-18 14:33:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:54,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:54,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] [2019-12-18 14:33:54,477 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 4 times [2019-12-18 14:33:54,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:54,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667957436] [2019-12-18 14:33:54,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:33:54,653 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-18 14:33:54,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667957436] [2019-12-18 14:33:54,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:33:54,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:33:54,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978868720] [2019-12-18 14:33:54,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:33:54,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:33:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:33:54,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:33:54,655 INFO L87 Difference]: Start difference. First operand 8674 states and 25965 transitions. Second operand 12 states. [2019-12-18 14:33:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:33:55,289 INFO L93 Difference]: Finished difference Result 9880 states and 28998 transitions. [2019-12-18 14:33:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:33:55,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:33:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:33:55,304 INFO L225 Difference]: With dead ends: 9880 [2019-12-18 14:33:55,304 INFO L226 Difference]: Without dead ends: 9238 [2019-12-18 14:33:55,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:33:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2019-12-18 14:33:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 8384. [2019-12-18 14:33:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8384 states. [2019-12-18 14:33:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8384 states to 8384 states and 25211 transitions. [2019-12-18 14:33:55,438 INFO L78 Accepts]: Start accepts. Automaton has 8384 states and 25211 transitions. Word has length 56 [2019-12-18 14:33:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:33:55,438 INFO L462 AbstractCegarLoop]: Abstraction has 8384 states and 25211 transitions. [2019-12-18 14:33:55,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:33:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8384 states and 25211 transitions. [2019-12-18 14:33:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:33:55,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:33:55,449 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] [2019-12-18 14:33:55,451 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:33:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:33:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 5 times [2019-12-18 14:33:55,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:33:55,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027274714] [2019-12-18 14:33:55,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:33:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:33:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:33:55,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:33:55,690 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:33:55,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26|) |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1906~0.base_26|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26| 1) |v_#valid_62|) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ULTIMATE.start_main_~#t1906~0.offset=|v_ULTIMATE.start_main_~#t1906~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ULTIMATE.start_main_~#t1906~0.base=|v_ULTIMATE.start_main_~#t1906~0.base_26|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1907~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1908~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t1906~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1906~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1907~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1908~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:33:55,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1907~0.base_10|) (= |v_ULTIMATE.start_main_~#t1907~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10|) |v_ULTIMATE.start_main_~#t1907~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1907~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1907~0.base, #length] because there is no mapped edge [2019-12-18 14:33:55,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= (mod v_~x$w_buff1_used~0_45 256) 0) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_8 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (= v_P1Thread1of1ForFork0_~arg.base_8 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0~0_22) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_8, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_8, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:33:55,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11| 1) |v_#valid_27|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| 4) |v_#length_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11|) |v_ULTIMATE.start_main_~#t1908~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1908~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1908~0.base_11|) (= |v_ULTIMATE.start_main_~#t1908~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1908~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1908~0.offset] because there is no mapped edge [2019-12-18 14:33:55,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In951134029 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In951134029 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out951134029| ~x~0_In951134029) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out951134029| ~x$w_buff1~0_In951134029)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In951134029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In951134029, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In951134029, ~x~0=~x~0_In951134029} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out951134029|, ~x$w_buff1~0=~x$w_buff1~0_In951134029, ~x$w_buff1_used~0=~x$w_buff1_used~0_In951134029, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In951134029, ~x~0=~x~0_In951134029} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:33:55,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:33:55,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1022174472 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1022174472 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1022174472|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1022174472 |P2Thread1of1ForFork1_#t~ite34_Out1022174472|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1022174472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1022174472} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1022174472|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1022174472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1022174472} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:33:55,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1854737763 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1854737763 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-1854737763 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1854737763 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-1854737763 256) 0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite9_Out-1854737763| |P0Thread1of1ForFork2_#t~ite8_Out-1854737763|) (= ~x$w_buff0~0_In-1854737763 |P0Thread1of1ForFork2_#t~ite8_Out-1854737763|)) (and (= |P0Thread1of1ForFork2_#t~ite8_In-1854737763| |P0Thread1of1ForFork2_#t~ite8_Out-1854737763|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite9_Out-1854737763| ~x$w_buff0~0_In-1854737763)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1854737763, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1854737763, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1854737763|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1854737763, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1854737763, ~weak$$choice2~0=~weak$$choice2~0_In-1854737763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854737763} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1854737763, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1854737763, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1854737763|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1854737763, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1854737763|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1854737763, ~weak$$choice2~0=~weak$$choice2~0_In-1854737763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1854737763} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:33:55,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-186276122 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-186276122 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-186276122| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-186276122| ~x$w_buff0_used~0_In-186276122) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-186276122, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-186276122, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-186276122|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-186276122} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:33:55,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In973424429 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In973424429 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In973424429 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In973424429 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out973424429| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out973424429| ~x$w_buff1_used~0_In973424429) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In973424429, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In973424429, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In973424429, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973424429} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In973424429, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In973424429, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In973424429, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out973424429|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In973424429} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:33:55,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-84701350 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-84701350 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-84701350 ~x$r_buff0_thd2~0_In-84701350) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out-84701350 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-84701350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-84701350} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-84701350|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-84701350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-84701350} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:33:55,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1714988571 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1714988571 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1714988571 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1714988571 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1714988571|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1714988571 |P1Thread1of1ForFork0_#t~ite31_Out1714988571|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1714988571, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1714988571, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1714988571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1714988571} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1714988571|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1714988571, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1714988571, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1714988571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1714988571} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:33:55,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:33:55,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-177865761 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-177865761 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-177865761 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-177865761 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-177865761|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-177865761 |P2Thread1of1ForFork1_#t~ite35_Out-177865761|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-177865761, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-177865761, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-177865761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177865761} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-177865761|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-177865761, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-177865761, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-177865761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-177865761} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:33:55,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In25165293 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In25165293 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out25165293|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In25165293 |P2Thread1of1ForFork1_#t~ite36_Out25165293|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25165293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25165293} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out25165293|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In25165293, ~x$w_buff0_used~0=~x$w_buff0_used~0_In25165293} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:33:55,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-982222175 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-982222175| |P0Thread1of1ForFork2_#t~ite17_Out-982222175|) (= |P0Thread1of1ForFork2_#t~ite18_Out-982222175| ~x$w_buff1_used~0_In-982222175)) (and .cse0 (= ~x$w_buff1_used~0_In-982222175 |P0Thread1of1ForFork2_#t~ite17_Out-982222175|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-982222175 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-982222175 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-982222175 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-982222175 256))))) (= |P0Thread1of1ForFork2_#t~ite18_Out-982222175| |P0Thread1of1ForFork2_#t~ite17_Out-982222175|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-982222175, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-982222175|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982222175, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-982222175, ~weak$$choice2~0=~weak$$choice2~0_In-982222175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982222175} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-982222175, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-982222175|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-982222175|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-982222175, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-982222175, ~weak$$choice2~0=~weak$$choice2~0_In-982222175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-982222175} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:33:55,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:33:55,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-229225903 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-229225903| ~x$r_buff1_thd1~0_In-229225903) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-229225903| |P0Thread1of1ForFork2_#t~ite24_Out-229225903|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-229225903 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-229225903 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-229225903 256) 0)) (= (mod ~x$w_buff0_used~0_In-229225903 256) 0)))) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-229225903| ~x$r_buff1_thd1~0_In-229225903) (= |P0Thread1of1ForFork2_#t~ite23_In-229225903| |P0Thread1of1ForFork2_#t~ite23_Out-229225903|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-229225903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229225903, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-229225903, ~weak$$choice2~0=~weak$$choice2~0_In-229225903, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-229225903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229225903} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-229225903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-229225903, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-229225903, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-229225903|, ~weak$$choice2~0=~weak$$choice2~0_In-229225903, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-229225903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-229225903} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:33:55,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1174968529 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1174968529 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1174968529 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1174968529 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1174968529| ~x$r_buff1_thd3~0_In1174968529) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1174968529|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1174968529, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1174968529, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1174968529|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1174968529, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1174968529, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1174968529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1174968529} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:33:55,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:33:55,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:33:55,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:33:55,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-118279233 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-118279233 256) 0))) (or (and (= ~x$w_buff1~0_In-118279233 |ULTIMATE.start_main_#t~ite41_Out-118279233|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-118279233| ~x~0_In-118279233)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-118279233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-118279233, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-118279233, ~x~0=~x~0_In-118279233} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-118279233|, ~x$w_buff1~0=~x$w_buff1~0_In-118279233, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-118279233, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-118279233, ~x~0=~x~0_In-118279233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:33:55,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:33:55,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1088775334 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1088775334 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1088775334|)) (and (= ~x$w_buff0_used~0_In-1088775334 |ULTIMATE.start_main_#t~ite43_Out-1088775334|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1088775334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088775334} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1088775334, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1088775334|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1088775334} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:33:55,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-580785170 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-580785170 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-580785170 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-580785170 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-580785170 |ULTIMATE.start_main_#t~ite44_Out-580785170|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-580785170|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-580785170, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-580785170, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-580785170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580785170} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-580785170, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-580785170, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-580785170, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-580785170|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580785170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:33:55,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1685047365 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1685047365 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1685047365|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1685047365| ~x$r_buff0_thd0~0_In1685047365) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1685047365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1685047365} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1685047365, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1685047365|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1685047365} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:33:55,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1656492571 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1656492571 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1656492571 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1656492571 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1656492571 |ULTIMATE.start_main_#t~ite46_Out1656492571|)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1656492571|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1656492571, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1656492571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1656492571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1656492571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1656492571, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1656492571|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1656492571, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1656492571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1656492571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:33:55,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 0) (= v_~y~0_272 2) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:33:55,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:33:55 BasicIcfg [2019-12-18 14:33:55,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:33:55,806 INFO L168 Benchmark]: Toolchain (without parser) took 174622.90 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.1 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,807 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.81 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 157.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 155.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,812 INFO L168 Benchmark]: Boogie Preprocessor took 57.84 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,813 INFO L168 Benchmark]: RCFGBuilder took 885.43 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 106.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,813 INFO L168 Benchmark]: TraceAbstraction took 172837.73 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.8 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:33:55,816 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.25 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.81 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 157.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 155.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.84 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.43 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 106.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 172837.73 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.8 MB in the beginning and 2.8 GB in the end (delta: -2.7 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: 6.1s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 172.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 49.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4999 SDtfs, 6240 SDslu, 13020 SDs, 0 SdLazy, 6999 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 44 SyntacticMatches, 18 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169732occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 102.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 210841 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 124161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...